Pages that link to "Item:Q1605173"
From MaRDI portal
The following pages link to Fixpoint semantics for logic programming a survey (Q1605173):
Displaying 50 items.
- Game semantics for non-monotonic intensional logic programming (Q345702) (← links)
- An analysis of the equational properties of the well-founded fixed point (Q347388) (← links)
- Program equilibrium -- a program reasoning approach (Q361805) (← links)
- A game semantics for disjunctive logic programming (Q388214) (← links)
- Approximating operators and semantics for abstract dialectical frameworks (Q490444) (← links)
- Ultimate approximation and its application in nonmonotonic knowledge representation systems (Q598245) (← links)
- A top-\(k\) query answering procedure for fuzzy logic programming (Q695268) (← links)
- Convergence and fixed points by fuzzy orders (Q835121) (← links)
- Generalized metric spaces: a survey (Q889909) (← links)
- Grounded fixpoints and their applications in knowledge representation (Q892232) (← links)
- Semantic-based construction of arguments: an answer set programming approach (Q899190) (← links)
- Inductive situation calculus (Q1028914) (← links)
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
- Logic programs, well-orderings, and forward chaining (Q1295428) (← links)
- Annotated revision programs (Q1603740) (← links)
- Safe inductions and their applications in knowledge representation (Q1647517) (← links)
- Four-valued paradefinite logics (Q1685565) (← links)
- Fixpoint semantics for active integrity constraints (Q1693567) (← links)
- An encompassing framework for paraconsistent logic programs (Q1775864) (← links)
- A comparison of fuzzy and annotated logic programming (Q1827314) (← links)
- Uniform semantic treatment of default and autoepistemic logics (Q1853682) (← links)
- Logic programs and connectionist networks (Q1884268) (← links)
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs (Q1926591) (← links)
- Non-dual modal operators as a basis for 4-valued accessibility relations in hybrid logic (Q2043815) (← links)
- Fixed point semantics for stream reasoning (Q2046012) (← links)
- Recursive rules with aggregation: a simple unified semantics (Q2151406) (← links)
- A fixed point theorem for non-monotonic functions (Q2257304) (← links)
- The logic of generalized truth values and the logic of bilattices (Q2350215) (← links)
- Fuzzy autoepistemic logic and its relation to fuzzy answer set programming (Q2351607) (← links)
- Bilattices for deductions in multi-valued logic (Q2353941) (← links)
- An infinite-game semantics for well-founded negation in logic programming (Q2474440) (← links)
- Any-world assumptions in logic programming (Q2566297) (← links)
- On dual programs in co-logic programming and the Horn \({\mu}\)-calculus (Q2628297) (← links)
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach (Q2642629) (← links)
- Ternary Equational Languages (Q2830209) (← links)
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs (Q2900518) (← links)
- Logical foundations and complexity of 4QL, a query language with unrestricted negation (Q2901212) (← links)
- Truth versus information in logic programming (Q2933087) (← links)
- Equational Properties of Stratified Least Fixed Points (Extended Abstract) (Q2947468) (← links)
- From Fuzzy to Annotated Semantic Web Languages (Q2970305) (← links)
- Quantitative Semantics for Uncertain Knowledge Bases (Q3143399) (← links)
- A FRAMEWORK FOR HANDLING LOGICAL INCONSISTENCIES IN THE FUSION OF BOOLEAN KNOWLEDGE BASES (Q3225383) (← links)
- BOOLEAN FUZZY SETS (Q3401466) (← links)
- A Formal Theory of Justifications (Q3449209) (← links)
- A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption (Q3524923) (← links)
- Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness (Q3532471) (← links)
- Paraconsistent Logic Programs with Four-Valued Rough Sets (Q3541044) (← links)
- Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs (Q4559803) (← links)
- Knowledge compilation of logic programs using approximation fixpoint theory (Q4592990) (← links)
- Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs (Q4982058) (← links)
