SMT-based Constraint Answer Set Solver EZSMT+

05/08/2019
by   Da Shen, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2021

Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches

Constraint answer set programming or CASP, for short, is a hybrid approa...
research
03/09/2000

Fages' Theorem and Answer Set Programming

We generalize a theorem by Francois Fages that describes the relationshi...
research
06/05/2009

The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments

We present the CIFF proof procedure for abductive logic programming with...
research
09/22/2020

Automated Aggregator – Rewriting with the Counting Aggregate

Answer set programming is a leading declarative constraint programming p...
research
09/01/2011

aspcud: A Linux Package Configuration Tool Based on Answer Set Programming

We present the Linux package configuration tool aspcud based on Answer S...
research
04/23/2018

Shared aggregate sets in answer set programming

Aggregates are among the most frequently used linguistic extensions of a...
research
10/06/2015

Disjunctive Answer Set Solvers via Templates

Answer set programming is a declarative programming paradigm oriented to...

Please sign up or login with your details

Forgot password? Click here to reset