Pages that link to "Item:Q686646"

The following pages link to The alternating fixpoint of logic programs with negation (Q686646):

Displaying 33 items.

• Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
• Ultimate approximation and its application in nonmonotonic knowledge representation systems (Q598245) (← links)
• FO(ID) as an extension of DL with rules (Q604911) (← links)
• Iterative belief revision in extended logic programming (Q672058) (← links)
• Contributions to the stable model semantics of logic programs with negation (Q672705) (← links)
• Monotonic aggregation in deductive databases (Q676422) (← links)
• Logic programming as classical inference (Q898781) (← links)
• Inductive situation calculus (Q1028914) (← links)
• Partial models and logic programming (Q1094151) (← links)
• Why not negation by fixpoint? (Q1176286) (← links)
• Soundness of abductive proof procedure with respect to constraint for non-ground abducibles (Q1274977) (← links)
• Well-founded semantics and stratification for ordered logic programs (Q1313371) (← links)
• Stratified least fixpoint logic (Q1331926) (← links)
• Games and total Datalog\(^{\lnot}\) queries (Q1575136) (← links)
• A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs (Q1926591) (← links)
• Logical-epistemic foundations of general game descriptions (Q2016080) (← links)
• Recursive rules with aggregation: a simple unified semantics (Q2151406) (← links)
• A fixed point theorem for non-monotonic functions (Q2257304) (← links)
• A new approach to hybrid probabilistic logic programs (Q2642628) (← links)
• (Q2767052) (← links)
• Topological investigations of the operators of the well-founded, and alternating fixed-point semantics of normal logic programs (Q2843619) (← links)
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs (Q2900518) (← links)
• Equational Properties of Stratified Least Fixed Points (Extended Abstract) (Q2947468) (← links)
• Characterising and Explaining Inconsistency in Logic Programs (Q3449230) (← links)
• Integrating Inductive Definitions in SAT (Q3498482) (← links)
• SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (Q3502709) (← links)
• Well-founded operators for normal hybrid MKNF knowledge bases (Q4592713) (← links)
• Datalog Queries Distributing over Components (Q5278203) (← links)
• Detection and exploitation of functional dependencies for model generation (Q5398289) (← links)
• Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic (Q5504646) (← links)
• The limits of fixed-order computation (Q5940930) (← links)
• A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics (Q5958767) (← links)
• Transformation-based bottom-up computation of the well-founded model (Q6623799) (← links)