dcs: An Implementation of DATALOG with Constraints

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
6 pages (AAAI format), 4 ps figures; System descriptions and demonstration Session, 8th Intl. Workshop on Non-Monotonic Reasoning

Keywords

Artificial Intelligence, I.2.3;I.2.4;I.2.8;F.4.1;F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30221

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0003061
 http://arxiv.org/abs/cs/0003061

Collections

arXiv