Search Results for author:
Found 9 papers, 0 papers with code
Safe Formulas in the General Theory of Stable Models
Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers.
Causal Laws and Multi-Valued Fluents
This paper continues the line of work on representing properties of actions in nonmonotonic formalisms that stresses the distinction between being "true" and being "caused", as in the system of causal logic introduced by McCain and Turner and in the action language C proposed by Giunchiglia and Lifschitz.
Positive Dependency Graphs Revisited
Several results in that theory refer to the concept of the positive dependency graph of a logic program.
Verification of Locally Tight Programs
For tight programs, that generalization of completion is known to match the stable model semantics, which is the basis of answer set programming.
Verifying Tight Logic Programs with anthem and Vampire
This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories.
Achievements in Answer Set Programming
This paper describes an approach to the methodology of answer set programming (ASP) that can facilitate the design of encodings that are easy to understand and provably correct.
Stable Models for Infinitary Formulas with Extensional Atoms
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages.
On the Semantics of Gringo
Input languages of answer set solvers are based on the mathematically simple concept of a stable model.
