• Corpus ID: 148573372

SMT-based Constraint Answer Set Solver EZSMT+

@article{Shen2019SMTbasedCA,
  title={SMT-based Constraint Answer Set Solver EZSMT+},
  author={Da Shen and Yuliya Lierler},
  journal={ArXiv},
  year={2019},
  volume={abs/1905.03334}
}
Constraint answer set programming integrates answer set programming with constraint processing. System EZSMT+ is a constraint answer set programming tool that utilizes satisfiability modulo theory solvers for search. Its theoretical foundation lies on generalizations of Niemela's characterization of answer sets of a logic program via so called level rankings. 

Clingo goes linear constraints over reals and integers*

This work introduces extensions to clingo with difference and linear constraints over integers and reals, respectively, and realizes them in complementary ways.

The Sixth Answer Set Programming Competition

This edition of the Sixth ASP Competition maintained some of the design decisions introduced in 2014, but featured also some novelties, like a benchmark selection stage classifying instances according to their empirical hardness, and a “Marathon” track where the topperforming systems are given more time for solving hard benchmarks.

How to build your own ASP-based system?!

This tutorial shows how the ASP system clingo can be used for extending ASP and for implementing customized special-purpose systems and shows how guess-and-check programming can be implemented with both meta and application programming.

References

SHOWING 1-10 OF 20 REFERENCES

SMT-Based Constraint Answer Set Solver EZSMT+ for Non-Tight Programs

System EZSMT is a constraint answer set programming tool that utilizes satisfiability modulo theory solvers for search that has the capability to process linear as well as nonlinear constraints simultaneously containing integer and linear constraints.

SMT-Based Constraint Answer Set Solver EZSMT (System Description)

Experimental results demonstrate that SMT is a viable technology for constraint answer set programming and one of the first SMT-based solvers for constraint question set programming is presented.

SMT-Based Answer Set Solver CMODELS(DIFF) (System Description)

This paper presents the CMODELS(DIFF) system that uses Satisfiability Modulo Theory solvers to find answer sets of a logic program.

Conflict-Driven Answer Set Enumeration

This work extends a recently proposed approach to finding an answer set of a logic program based on concepts from constraint processing and satisfiability checking and proposes a new algorithm for enumerating answer sets that is implemented in the clasp answer set solver.

Constraint Answer Set Solving

An algorithmic framework for conflict-driven ASP solving that exploits CP solving capacities is developed, combining ASP solver clingo with the generic CP solver gecode, and its computational impact is empirically investigated.

Answer Set Programming Modulo Theories and Reasoning about Continuous Changes

The usefulness of ASPMT is demonstrated by enhancing action language C+ to handle continuous changes as well as discrete changes, and it is shown how the language can represent cumulative effects on continuous resources.

Constraint answer set solver EZCSP and why integration schemas matter

This paper presents the first comprehensive account of the constraint answer set language and solver ezcsp, a mainstream representative of this research area that has been used in various successful applications, and develops an extension of the transition systems proposed by Nieuwenhuis et al. in 2006 to capture Boolean satisfiability solvers.

On relation between constraint answer set programming and satisfiability modulo theories*

This paper provides a translation from constraint answer set programs with integer linear constraints to satisfiability modulo linear integer arithmetic that paves the way to utilizing modern satisfiable modulo theories solvers for computing answer sets of constraint question set programs.

SAT-Based Answer Set Programming

This paper presents a SAT-based decision procedure for answer set programming that deals with any (non disjunctive) logic program, works on a SAT formula without additional variables, and is guaranteed to work in polynomial space.

ASSAT: computing answer sets of a logic program by SAT solvers