Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-09T12:17:25.213Z Has data issue: false hasContentIssue false

Dynamic Consistency Checking in Goal-Directed Answer Set Programming

Published online by Cambridge University Press:  21 July 2014

KYLE MARPLE
Affiliation:
Department of Computer Science, The University of Texas at Dallas (e-mail: kbm072000@utdallas.edu, gupta@utdallas.edu)
GOPAL GUPTA
Affiliation:
Department of Computer Science, The University of Texas at Dallas (e-mail: kbm072000@utdallas.edu, gupta@utdallas.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In answer set programming, inconsistencies arise when the constraints placed on a program become unsatisfiable. In this paper, we introduce a technique for dynamic consistency checking for our goal-directed method for computing answer sets, under which only those constraints deemed relevant to the partial answer set are tested, allowing inconsistent knowledgebases to be successfully queried. However, the algorithm guarantees that, if a program has at least one consistent answer set, any partial answer set returned will be a subset of some consistent answer set.

Information

Type
Regular Papers
Copyright
Copyright © Cambridge University Press 2014