Abstract
The paper introduces a collection of knowledge representation languages, \({\mathcal V(C)}\), parametrised over a class \({\mathcal C}\) of constraints. \({\mathcal V(C)}\) is an extension of both CR-Prolog and CASP allowing the separation of a program into two parts: a regular program of CR-Prolog and a collection of denials whose bodies contain constraints from \({\mathcal C}\) with variables ranging over large domains. We study an instance \({{\mathcal AC}_0}\) from this family where \({\mathcal C}\) is a collection of constraints of the form X − Y > K. We give brief implementation details of an algorithm computing the answer sets of programs of \({{\mathcal AC}_0}\) which does not ground constraint variables and tightly couples the “classical” ASP algorithm with an algorithm checking consistency of difference constraints. We present several examples to show the methodology of representing knowledge in \({{\mathcal AC}_0}\). The work makes it possible to solve problems which could not be solved by pure ASP or constraint solvers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
GNU Prolog, http://www.gprolog.org
Balduccini, M.: Answer Set Based Design of Highly Autonomous, Rational Agents. PhD thesis, Texas Tech University (December, 2005)
Balduccini, M.: CR-models: An inference engine for CR-prolog. In: Logic Programming and Nonmonotonic Reasoning (May, 2007)
Balduccini, M., Gelfond, M., Nogueira, M.: Answer set based design of knowledge systems. Annals of Mathematics and Artificial Intelligence (2006)
Baselice, S., Bonatti, P.A., Gelfond, M.: Towards an integration of answer set and constraint solving. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 52–66. Springer, Heidelberg (2005)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP-1988, pp. 1070–1080 (1988)
Veena, S.: Mellarkod. Optimizing the computation of stable models using merged rules. Master’s thesis, Texas Tech University (May, 2002)
Niemela, I., Simons, P.: Extending the Smodels System with Cardinality and Weight Constraints. In: Logic-Based Artificial Intelligence, pp. 491–521. Kluwer Academic Publishers, Dordrecht (2000)
Pollack, M.E., et al.: Pearl: A mobile robotic assistant for the elderly. In: AAAI Workshop on Automation as Eldercare (August, 2002)
Pollack, M.E., et al.: Autominder: An intelligent cognitive orthotic system for people with memory impairment. Robotics and Autonomous Systems 44(3-4), 273–282 (2003)
Pollack, M.E., Muscettola, N.: Temporal and resource reasoning for planning, scheduling and execution. In: Tutorial Forum Notes, AAAI 2006 (July, 2006)
Rossi, F., Sperduti, A., Venable, K., Khatib, L., Morris, P., Morris, R.: Learning and solving soft temporal constraints: An experimental study (2002)
Syrjanen, T.: Implementation of logical grounding for logic programs with stable model semantics. Technical Report 18, Digital Systems Laboratory, Helsinki University of Technology (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mellarkod, V.S., Gelfond, M. (2008). Integrating Answer Set Reasoning with Constraint Solving Techniques. In: Garrigue, J., Hermenegildo, M.V. (eds) Functional and Logic Programming. FLOPS 2008. Lecture Notes in Computer Science, vol 4989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78969-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-78969-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78968-0
Online ISBN: 978-3-540-78969-7
eBook Packages: Computer ScienceComputer Science (R0)