dcs: An Implementation of DATALOG with Constraints

dc.creatorEast, Deborah
dc.creatorTruszczynski, Miroslaw
dc.date2000-03-14
dc.date.accessioned2026-07-07T03:16:05Z
dc.date.available2026-07-07T03:16:05Z
dc.descriptionAnswer-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.
dc.description6 pages (AAAI format), 4 ps figures; System descriptions and demonstration Session, 8th Intl. Workshop on Non-Monotonic Reasoning
dc.identifierhttps://arxiv.org/abs/cs/0003061
dc.identifierhttp://arxiv.org/abs/cs/0003061
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30221
dc.subjectArtificial Intelligence
dc.subjectI.2.3;I.2.4;I.2.8;F.4.1;F.2.2
dc.titledcs: An Implementation of DATALOG with Constraints
dc.typetext

Files

Collections