Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Abstract Disjunctive Answer Set Solvers, Remi Brochenin, Yuliya Lierler, Marco Maratea
Abstract Disjunctive Answer Set Solvers, Remi Brochenin, Yuliya Lierler, Marco Maratea
Computer Science Faculty Proceedings & Presentations
A fundamental task in answer set programming is to compute answer sets of logic programs. Answer set solvers are the programs that perform this task. The problem of deciding whether a disjunctive program has an answer set isΣP2 -complete. The high complexity of reasoning within disjunctive logic programming is responsible for few solvers capable of dealing with such programs, namely DLV, GNT, CMODELS and CLASP. We show that transition systems introduced by Nieuwenhuis, Oliveras, and Tinelli to model and analyze satisfiability solvers can be adapted for disjunctive answer set solvers. In particular, we present transition systems for CMODELS …
Abstract Modular Inference Systems And Solvers, Yuliya Lierler, Miroslaw Truszczyński
Abstract Modular Inference Systems And Solvers, Yuliya Lierler, Miroslaw Truszczyński
Computer Science Faculty Proceedings & Presentations
Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience and computational benefits. We introduce the concepts of abstract inference modules and abstract modular inference systems to study general principles behind the design and analysis of model-generating programs, or solvers, for integrated multilogic systems.We show how modules and modular systems give rise to transition graphs, which are a natural and convenient representation of solvers, an idea pioneered by the SAT community. We illustrate our approach by showing how it applies to answer-set programming and propositional logic, and to multi-logic systems based on these two formalisms.