Pages that link to "Item:Q1354038"

The following pages link to A theory of nonmonotonic rule systems. II (Q1354038):

Displaying 13 items.

• Annotated nonmonotonic rule systems (Q673384) (← links)
• My work with Victor Marek: a mathematician looks at answer set programming (Q1028636) (← links)
• How complicated is the set of stable models of a recursive logic program? (Q1192346) (← links)
• Logic programs, well-orderings, and forward chaining (Q1295428) (← links)
• A context for belief revision: forward chaining-normal nonmonotonic rule systems (Q1326782) (← links)
• An abstract, argumentation-theoretic approach to default reasoning (Q1402718) (← links)
• The complexity of predicate default logic over a countable domain (Q1861328) (← links)
• Complexity and undecidability results for logic programming (Q1924779) (← links)
• On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
• A topological characterization of the stable and minimal model classes of propositional logic programs (Q1924782) (← links)
• 2000 Annual Meeting of the Association for Symbolic Logic (Q4527937) (← links)
• On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP (Q5504658) (← links)
• 2000-2001 Winter Meeting of the Association for Symbolic Logic (Q5890457) (← links)