Log in

Relevant bibliographies by topics / Stratified logic

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Stratified logic'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Stratified logic.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Stratified logic"

1

Przymusinska, Halina, and Teodor C. Przymusinski. "Weakly Stratified Logic Programs1." Fundamenta Informaticae 13, no. 1 (1990): 51–65. http://dx.doi.org/10.3233/fi-1990-13106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

PRIOR, A. N. "Stratified Metric Tense Logic." Theoria 33, no. 1 (2008): 28–38. http://dx.doi.org/10.1111/j.1755-2567.1967.tb00607.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Compton, Kevin J. "Stratified least fixpoint logic." Theoretical Computer Science 131, no. 1 (1994): 95–120. http://dx.doi.org/10.1016/0304-3975(94)90091-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Fitting, Melvin, and Marion Ben-Jacob. "Stratified, Weak Stratified, and Three-Valued Semantics1." Fundamenta Informaticae 13, no. 1 (1990): 19–33. http://dx.doi.org/10.3233/fi-1990-13104.

Full text

Abstract:

We investigate the relationship between three-valued Kripke/Kleene semantics and stratified semantics for stratifiable logic programs. We first show these are compatible, in the sense that if the three-valued semantics assigns a classical truth value, the stratified approach will assign the same value. Next, the familiar fixed point semantics for pure Horn clause programs gives both smallest and biggest fixed points fundamental roles. We show how to extend this idea to the family of stratifiable logic programs, producing a semantics we call weak stratified. Finally, we show weak stratified sem

APA, Harvard, Vancouver, ISO, and other styles

5

Pétry, A. "Stratified languages." Journal of Symbolic Logic 57, no. 4 (1992): 1366–76. http://dx.doi.org/10.2307/2275371.

Full text

Abstract:

AbstractWe consider arbitrary stratified languages. We study structures which satisfy the same stratified sentences and we obtain an extension of Keisler's Isomorphism Theorem to this situation. Then we consider operations which are definable by a stratified formula and modify the ‘type’ of their argument by one; we prove that for such an operation F the sentence c = F(c) and the scheme φ(c) ↔ (F(c)), where ↔(x) varies among all the stratified formulas with no variable other than x free, imply the same stratified {c}-sentences.

APA, Harvard, Vancouver, ISO, and other styles

6

Grädel, Erich, and Gregory L. McColm. "Hierarchies in transitive closure logic, stratified Datalog and infinitary logic." Annals of Pure and Applied Logic 77, no. 2 (1996): 169–99. http://dx.doi.org/10.1016/0168-0072(95)00021-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Baheri, Ali, and Peng Wei. "Multi-Fidelity Temporal Reasoning: A Stratified Logic for Cross-Scale System Specifications." Logics 3, no. 2 (2025): 5. https://doi.org/10.3390/logics3020005.

Full text

Abstract:

We present Stratified Metric Temporal Logic (SMTL), a novel formalism for specifying and verifying the properties of complex cyber–physical systems that exhibit behaviors across multiple temporal and abstraction scales. SMTL extends existing temporal logics by incorporating a stratification operator, enabling the association of temporal properties with specific abstraction levels. This allows for the natural expression of multi-scale requirements while maintaining formal reasoning about inter-level relationships. We formalize the syntax and semantics of SMTL, proving that it strictly subsumes

APA, Harvard, Vancouver, ISO, and other styles

8

Kolaitis, Phokion G. "The expressive power of stratified logic programs." Information and Computation 90, no. 1 (1991): 50–66. http://dx.doi.org/10.1016/0890-5401(91)90059-b.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Xu, Daoyun, and Decheng Ding. "FC-normal and extended stratified logic program." Science in China Series F Information Sciences 45, no. 4 (2002): 259–72. http://dx.doi.org/10.1360/02yf9023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Balbiani, Philippe. "A Modal Semantics of Negation in Logic Programming." Fundamenta Informaticae 16, no. 3-4 (1992): 231–62. http://dx.doi.org/10.3233/fi-1992-163-403.

Full text

Abstract:

The beauty of modal logics and their interest lie in their ability to represent such different intensional concepts as knowledge, time, obligation, provability in arithmetic, … according to the properties satisfied by the accessibility relations of their Kripke models (transitivity, reflexivity, symmetry, well-foundedness, …). The purpose of this paper is to study the ability of modal logics to represent the concepts of provability and unprovability in logic programming. The use of modal logic to study the semantics of logic programming with negation is defended with the help of a modal comple

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Stratified logic"

1

Persson, Westin Elin. "Homological properties of some stratified algebras." Licentiate thesis, Uppsala universitet, Algebra och geometri, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-426125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lagerqvist, Victor. "A comparison of SL- and unit-resolution search rules for stratified logic programs." Thesis, Linköping University, TCSLAB - Theoretical Computer Science Laboratory, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57363.

Full text

Abstract:

<p>There are two symmetrical resolution rules applicable to logic programs - SL-resolution which yields a top-down refutation and unit-resolution which yields a bottom-up refutation. Both resolution principles need to be coupled with a search rule before they can be used in practice. The search rule determines in which order program clauses are used in the refutation and affects both performance, completeness and quality of solutions. The thesis surveys exhaustive and heuristic search rules for SL-resolution and transformation techniques for (general) logic programs that makes unit-resolution

APA, Harvard, Vancouver, ISO, and other styles

3

Green, Cristina. "Numerical modelling of convective instability in a stratified shear layer and wave-like properties of solar supergranulation /." May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

KOZHEMIACHENKO, Daniil. "Paraconsistent and fuzzy modal logics for reasoning about uncertainty." Electronic Thesis or Diss., Bourges, INSA Centre Val de Loire, 2023. http://www.theses.fr/2023ISAB0014.

Full text

Abstract:

Ce manuscrit est dédié à l'étude des logiques modales floues qui formalisent le raisonnement (paraconsistant) sur l'incertitude. Ici, l'interprétation d'«information (données) incertain(es)» inclut toute combinaison des trois propriétés suivantes. Premièrement, l'information peur être quantifiée, i.e., la proposition est associée à un degré de vérité plutôt qu'une valeur de vérité. Deuxièmement, l'information peut être incomplète. Troisièmement, l'information peut être contradictoire.Toutes les logiques étudiees se divisent en deux groupes. Les plus «traditionnelles» dont la sémantique est con

APA, Harvard, Vancouver, ISO, and other styles

5

Ahmadouche, Ahmed Abdelkader. "Modélisation électrique des interconnexions multiniveaux en présence de diélectriques stratifiés." Grenoble INPG, 1987. http://www.theses.fr/1987INPG0140.

Full text

Abstract:

Modelisation des lignes d'interconnexions dans un circuit logique a partir de matrices capacite, inductance resistance et conductance. Le probleme est traite en deux ou trois dimensions suivant la configuration envisagee. Presentation des resultats theoriques obtenus sur des dispositifs realises en technologie silicium et arseniure de gallium et en technologie hybride et comparaison a ceux issus du test

APA, Harvard, Vancouver, ISO, and other styles

6

Cao, Son. "Methods for evaluating queries to Horn knowledge bases in first-order logic." Doctoral thesis, 2015.

Find full text

Abstract:

Horn knowledge bases are extensions of Datalog deductive databases without the range-restrictedness and function-free conditions. A Horn knowledge base consists of a positive logic program for defining intensional predicates and an instance of extensional predicates. This dissertation concentrates on developing efficient methods for evaluating queries to Horn knowledge bases. In addition, a method for evaluating queries to stratified knowledge bases is also investigated. This topic has not been well studied as query processing for Datalog-like deductive databases or the theory and techniques o

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Stratified logic"

1

Vogt, Manuel. Mobilization and Conflict in Multiethnic States. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780190065874.001.0001.

Full text

Abstract:

Why are ethnic movements more likely to turn violent in some multiethnic countries than in others? Focusing on the long-term legacies of European colonialism, this book presents two ideal-typical logics of ethnic group mobilization—one of violent competition and another of nonviolent emancipatory opposition. The book’s theory first explains why ethnic grievances are translated into either violent or nonviolent forms of conflict as a function of distinct ethnic cleavage types, resulting from different colonial experiences. Violent intergroup conflict is least likely where settler colonialism re

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Stratified logic"

1

Cholewiński, Paweł. "Stratified default theories." In Computer Science Logic. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/bfb0022275.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Schmidt-Schauß, Manfred. "Stratified Context Unification Is in PSPACE." In Computer Science Logic. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44802-0_35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Osorio, Mauricio, and Juan Carlos Nieves. "Stratified Partial-Order Logic Programming." In Advances in Artificial Intelligence. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45153-6_22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Cholewiński, Paweł. "Reasoning with stratified default theories." In Logic Programming and Nonmonotonic Reasoning. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-59487-6_20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Arieli, Ofer, and Arnon Avron. "Four-valued diagnoses for stratified knowledge-bases." In Computer Science Logic. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63172-0_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Logan, Shay Allen. "Hyperdoctrines and the Ontology of Stratified Semantics." In Trends in Logic. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-52163-9_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bezzazi, Hassan. "Revision and Update Based on Stratified Forward Chaining." In Applied Logic Series. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-015-9817-0_16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Charatonik, Witold, Supratik Mukhopadhyay, and Andreas Podelski. "Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP." In Logic Programming. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45619-8_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ésik, Zoltán. "A Representation Theorem for Stratified Complete Lattices." In Logic, Language, and Computation. Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-54332-0_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Fioravanti, Fabio, Alberto Pettorossi, and Maurizio Proietti. "Transformation Rules for Locally Stratified Constraint Logic Programs." In Program Development in Computational Logic. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-25951-0_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Stratified logic"

1

Gradel, E., and G. L. McColm. "Hierarchies in transitive closure logic, stratified Datalog and infinitary logic." In Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE, 1992. http://dx.doi.org/10.1109/sfcs.1992.267775.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Schopp, Ulrich. "Stratified Bounded Affine Logic for Logarithmic Space." In 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007). IEEE, 2007. http://dx.doi.org/10.1109/lics.2007.45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kaminski, Mark, Bernardo Cuenca Grau, Egor V. Kostylev, Boris Motik, and Ian Horrocks. "Stratified Negation in Limit Datalog Programs." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/259.

Full text

Abstract:

There has recently been an increasing interest in declarative data analysis, where analytic tasks are specified using a logical language, and their implementation and optimisation are delegated to a general-purpose query engine. Existing declarative languages for data analysis can be formalised as variants of logic programming equipped with arithmetic function symbols and/or aggregation, and are typically undecidable. In prior work, the language of limit programs was proposed, which is sufficiently powerful to capture many analysis tasks and has decidable entailment problem. Rules in this lang

APA, Harvard, Vancouver, ISO, and other styles

4

Lauer, Hagen, Amin Sakzad, Carsten Rudolph, and Surya Nepal. "A Logic for Secure Stratified Systems and its Application to Containerized Systems." In 2019 18th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/13th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE). IEEE, 2019. http://dx.doi.org/10.1109/trustcom/bigdatase.2019.00081.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Rondogiannis, Panos, and Ioanna Symeonidou. "The Intricacies of Three-Valued Extensional Semantics for Higher-Order Logic Programs." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/750.

Full text

Abstract:

In this paper we examine the problem of providing a purely extensional three-valued semantics for higher-order logic programs with negation. We demonstrate that a technique that was proposed by M. Bezem for providing extensional semantics to positive higher-order logic programs, fails when applied to higher-order logic programs with negation. On the positive side, we demonstrate that for stratified higher-order logic programs, extensionality is indeed achieved by the technique. We analyze the reasons of the failure of extensionality in the general case, arguing that a three-valued setting can

APA, Harvard, Vancouver, ISO, and other styles

6

Nordin, Gregory P., Richard V. Johnson, and Armand R. Tanguay. "Physical characterization of stratified volume holographic optical elements." In OSA Annual Meeting. Optica Publishing Group, 1988. http://dx.doi.org/10.1364/oam.1988.wg1.

Full text

Abstract:

A computational algorithm for analyzing diffraction properties of optical devices, the optical beam propagation method, has suggested a new class of device [stratified volume holographic optical elements (SVHOEs)] by which Bragg regime (thick grating) response can be obtained from a spaced sequence of thin grating layers. The SVHOE device structure consists of a sequence of thin photosensitive holographic recording layers that perform the optical modulation function, interleaved with optically passive buffer layers, i.e., layers that impress no modulation on the light beam but rather allow the

APA, Harvard, Vancouver, ISO, and other styles

7

Kuzelka, Ondrej, Jesse Davis, and Steven Schockaert. "Induction of Interpretable Possibilistic Logic Theories from Relational Data." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/160.

Full text

Abstract:

The field of statistical relational learning (SRL) is concerned with learning probabilistic models from relational data. Learned SRL models are typically represented using some kind of weighted logical formulas, which makes them considerably more interpretable than those obtained by e.g. neural networks. In practice, however, these models are often still difficult to interpret correctly, as they can contain many formulas that interact in non-trivial ways and weights do not always have an intuitive meaning. To address this, we propose a new SRL method which uses possibilistic logic to encode re

APA, Harvard, Vancouver, ISO, and other styles

8

Balbiani, Philippe, David Fernández-Duque, Andreas Herzig, and Emiliano Lorini. "Stratified Evidence Logics." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/211.

Full text

Abstract:

Evidence logics model agents' belief revision process as they incorporate and aggregate information obtained from multiple sources. This information is captured using neighbourhood structures, where individual neighbourhoods represent pieces of evidence. In this paper we propose an extended framework which allows one to explicitly quantify either the number of evidence sets, or effort, needed to justify a given proposition, provide a complete deductive calculus and a proof of decidability, and show how existing frameworks can be embedded into ours.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!