On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP

DOI10.1007/978-3-540-89982-2_25zbMath1185.68169OpenAlexW1574509484MaRDI QIDQ5504658

Victor W. Marek, Jeffery B. Remmel

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_25

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (1)

My work with Victor Marek: a mathematician looks at answer set programming

Uses Software

• ASSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reasoning with infinite stable models
• A generalization of the Lin-Zhao theorem
• Answer set programming based on propositional satisfiability
• How complicated is the set of stable models of a recursive logic program?
• A context for belief revision: forward chaining-normal nonmonotonic rule systems
• A theory of nonmonotonic rule systems. II
• A theory of nonmonotonic rule systems I
• Extending and implementing the stable model semantics
• Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
• Nested expressions in logic programs
• Generic Tableaux for Answer Set Programming
• Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs
• The Stable Models of a Predicate Logic Program
• Weight constraints as nested expressions
• Why are there so many loop formulas?
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with monotone abstract constraint atoms
• Boolean Algebras with Operators. Part I

This page was built for publication: On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP