dcs: An Implementation of DATALOG with Constraints
Artificial Intelligence
2007-05-23 v1
Abstract
Answer-set programming (ASP) has emerged recently as a viable programming paradigm. We describe here an ASP system, DATALOG with constraints or DC, based on non-monotonic logic. 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, use and implementation of DC and provide experimental results.
Cite
@article{arxiv.cs/0003061,
title = {dcs: An Implementation of DATALOG with Constraints},
author = {Deborah East and Miroslaw Truszczynski},
journal= {arXiv preprint arXiv:cs/0003061},
year = {2007}
}
Comments
6 pages (AAAI format), 4 ps figures; System descriptions and demonstration Session, 8th Intl. Workshop on Non-Monotonic Reasoning