DATALOG with constraints - an answer-set programming system

03/24/2000
by   Deborah East, et al.
0

Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional logic is, arguably, the simplest ASP system with an intuitive semantics supporting direct modeling of problem constraints. However, for some applications, especially those requiring that transitive closure be computed, it requires additional variables and results in large theories. Consequently, it may not be a practical computational tool for such problems. On the other hand, ASP systems based on nonmonotonic logics, such as stable logic programming, can handle transitive closure computation efficiently and, in general, yield very concise theories as problem representations. Their semantics is, however, more complex. Searching for the middle ground, in this paper we introduce a new nonmonotonic logic, DATALOG with constraints or DC. Informally, DC theories consist of propositional clauses (constraints) and of Horn rules. The semantics is a simple and natural extension of the semantics of the propositional logic. However, thanks to the presence of Horn rules in the system, modeling of transitive closure becomes straightforward. We describe the syntax and semantics of DC, and study its properties. We discuss an implementation of DC and present results of experimental study of the effectiveness of DC, comparing it with CSAT, a satisfiability checker and SMODELS implementation of stable logic programming. Our results show that DC is competitive with the other two approaches, in case of many search problems, often yielding much more efficient solutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2000

dcs: An Implementation of DATALOG with Constraints

Answer-set programming (ASP) has emerged recently as a viable programmin...
research
11/25/2002

Propositional satisfiability in declarative programming

Answer-set programming (ASP) paradigm is a way of using logic to solve s...
research
04/14/2011

Backdoors to Tractable Answer-Set Programming

Answer Set Programming (ASP) is an increasingly popular framework for de...
research
03/08/2000

Logic Programming for Describing and Solving Planning Problems

A logic programming paradigm which expresses solutions to problems as st...
research
05/14/2014

Bound Founded Answer Set Programming

Answer Set Programming (ASP) is a powerful modelling formalism that is v...
research
09/17/2021

Aggregate Semantics for Propositional Answer Set Programs

Answer Set Programming (ASP) emerged in the late 1990ies as a paradigm f...
research
04/30/2021

Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory

Aggregates provide a concise way to express complex knowledge. While the...

Please sign up or login with your details

Forgot password? Click here to reset