Fixpoint semantics for logic programming a survey
From MaRDI portal
Publication:1605173
DOI10.1016/S0304-3975(00)00330-3zbMath1002.68023OpenAlexW2099792091MaRDI QIDQ1605173
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00330-3
Related Items (61)
On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Logic programs and connectionist networks ⋮ Convergence and fixed points by fuzzy orders ⋮ A Formal Theory of Justifications ⋮ On dual programs in co-logic programming and the Horn \({\mu}\)-calculus ⋮ Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs ⋮ Logical foundations and complexity of 4QL, a query language with unrestricted negation ⋮ Recursive rules with aggregation: a simple unified semantics ⋮ Safe inductions and their applications in knowledge representation ⋮ Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach ⋮ Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs ⋮ Game semantics for non-monotonic intensional logic programming ⋮ An analysis of the equational properties of the well-founded fixed point ⋮ Program equilibrium -- a program reasoning approach ⋮ Truth versus information in logic programming ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs ⋮ Unnamed Item ⋮ A game semantics for disjunctive logic programming ⋮ Equational Properties of Stratified Least Fixed Points (Extended Abstract) ⋮ Generalized metric spaces: a survey ⋮ Four-valued paradefinite logics ⋮ A FRAMEWORK FOR HANDLING LOGICAL INCONSISTENCIES IN THE FUSION OF BOOLEAN KNOWLEDGE BASES ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ An Asymptotic Analysis of Probabilistic Logic Programming, with Implications for Expressing Projective Families of Distributions ⋮ Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ Fixpoint semantics for active integrity constraints ⋮ Semantic-based construction of arguments: an answer set programming approach ⋮ Relation-changing models meet paraconsistency ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption ⋮ Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness ⋮ Unnamed Item ⋮ Paraconsistent Logic Programs with Four-Valued Rough Sets ⋮ Approximating operators and semantics for abstract dialectical frameworks ⋮ An infinite-game semantics for well-founded negation in logic programming ⋮ A top-\(k\) query answering procedure for fuzzy logic programming ⋮ A fixed point theorem for non-monotonic functions ⋮ On Dual Programs in Co-Logic Programming ⋮ An encompassing framework for paraconsistent logic programs ⋮ Non-dual modal operators as a basis for 4-valued accessibility relations in hybrid logic ⋮ Fixed point semantics for stream reasoning ⋮ Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs ⋮ Properties of General Semantic Operators Determined by Logic-Based Systems ⋮ Inductive situation calculus ⋮ Ternary Equational Languages ⋮ BOOLEAN FUZZY SETS ⋮ A comparison of fuzzy and annotated logic programming ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Any-world assumptions in logic programming ⋮ Logic programs, well-orderings, and forward chaining ⋮ Logic and Complexity in Cognitive Science ⋮ Uniform semantic treatment of default and autoepistemic logics ⋮ Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work) ⋮ Annotated revision programs ⋮ The logic of generalized truth values and the logic of bilattices ⋮ Quantitative Semantics for Uncertain Knowledge Bases ⋮ Partially ordered objects in a topos ⋮ Fuzzy autoepistemic logic and its relation to fuzzy answer set programming ⋮ Bilattices for deductions in multi-valued logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial models and logic programming
- Three-valued nonmonotonic formalisms and semantics of logic programs
- A lattice-theoretical fixpoint theorem and its applications
- The recursion-theoretic complexity of the semantics of predicate logic as a programming language
- A kripke-kleene semantics for logic programs*
- Quantitative deduction and its fixpoint theory
- Clausal intuitionistic logic I. fixed-point semantics
- Negation in logic programming
- Clausal intuitionistic logic II. tableau proof procedures
- Contributions to the Theory of Logic Programming
- Bilattices and the semantics of logic programming
- Kleene's Logic, Generalized
- The Semantics of Predicate Logic as a Programming Language
- The family of stable models
- The well-founded semantics for general logic programs
- Outline of a Theory of Truth
- The structure of interlaced bilattices
This page was built for publication: Fixpoint semantics for logic programming a survey
