Computer Science – Artificial Intelligence
Scientific paper
2011-05-03
Theory and Practice of Logic Programming, 27th Int'l. Conference on Logic Programming (ICLP'11) Special Issue, volume 11, issu
Computer Science
Artificial Intelligence
30 pages; Accepted for presentation at ICLP 2011 and for publication in Theory and Practice of Logic Programming; contains the
Scientific paper
10.1017/S1471068411000214
A fundamental task for propositional logic is to compute models of propositional formulas. Programs developed for this task are called satisfiability solvers. We show that transition systems introduced by Nieuwenhuis, Oliveras, and Tinelli to model and analyze satisfiability solvers can be adapted for solvers developed for two other propositional formalisms: logic programming under the answer-set semantics, and the logic PC(ID). We show that in each case the task of computing models can be seen as "satisfiability modulo answer-set programming," where the goal is to find a model of a theory that also is an answer set of a certain program. The unifying perspective we develop shows, in particular, that solvers CLASP and MINISATID are closely related despite being developed for different formalisms, one for answer-set programming and the latter for the logic PC(ID).
Lierler Yuliya
Truszczynski Miroslaw
No associations
LandOfFree
Transition Systems for Model Generators - A Unifying Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Transition Systems for Model Generators - A Unifying Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transition Systems for Model Generators - A Unifying Approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-694539