Pages that link to "Item:Q1192346"

The following pages link to How complicated is the set of stable models of a recursive logic program? (Q1192346):

Displaying 12 items.

• Annotated nonmonotonic rule systems (Q673384) (← links)
• My work with Victor Marek: a mathematician looks at answer set programming (Q1028636) (← links)
• A context for belief revision: forward chaining-normal nonmonotonic rule systems (Q1326782) (← links)
• A theory of nonmonotonic rule systems. II (Q1354038) (← links)
• The expressiveness of locally stratified programs (Q1924734) (← 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)
• Invertible classes (Q2382282) (← links)
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols (Q3498490) (← links)
• Index Sets for Finite Normal Predicate Logic Programs with Function Symbols (Q5283418) (← links)
• On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP (Q5504658) (← links)