The Stable Models of a Predicate Logic Program

DOI10.1016/S0743-1066(14)80008-3MaRDI QIDQ4318872zbMATH OpenOpenAlexFDO

Authors Wiktor Marek, Jeffrey Remmel, Anil Nerode

Publication date 6 February 1995

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0743-1066(14)80008-3

zbMATH Keywords

Turing degreesTuring complexityfinite predicate logic program

Mathematics Subject Classification ID

Logic programming (68N17) Logic in computer science (03B70)

Recommendations

• How complicated is the set of stable models of a recursive logic program?
• scientific article; zbMATH DE number 1368933
• Locally determined logic programs and recursive stable models
• scientific article; zbMATH DE number 1453054
• The family of stable models

Cited in

(22)

• Logic programming with infinite sets
• scientific article; zbMATH DE number 1884395 (Why is no real title available?)
• A note on the stable model semantics for logic programs
• Locally determined logic programs and recursive stable models
• How complicated is the set of stable models of a recursive logic program?
• On the existence and unicity of stable models in normal residuated logic programs
• Automata and Answer Set Programming
• My work with Victor Marek: a mathematician looks at answer set programming
• On the complexity of index sets for finite predicate logic programs which allow function symbols
• Index sets for finite normal predicate logic programs with function symbols
• Logic programs, well-orderings, and forward chaining
• Complexity and undecidability results for logic programming
• Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
• On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
• Composing Normal Programs with Function Symbols
• Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
• A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
• Logic programs with stable model semantics as a constraint programming paradigm
• The family of stable models
• On the Expressibility of Stable Logic Programming
• scientific article; zbMATH DE number 1114054 (Why is no real title available?)
• On the existence of stable models of non-stratified logic programs

This page was built for publication: The Stable Models of a Predicate Logic Program

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4318872)