Modeling and reasoning in event calculus using goal-directed constraint answer set programming

From MaRDI portal
Publication:5097632

DOI10.1007/978-3-030-45260-5_9zbMATH Open1502.68282arXiv2106.14566OpenAlexW3020620556MaRDI QIDQ5097632FDOQ5097632


Authors: Joaquin Arias, Zhuo Chen, M. Carro, Gopal Gupta Edit this on Wikidata


Publication date: 25 August 2022

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Abstract: Automated commonsense reasoning is essential for building human-like AI systems featuring, for example, explainable AI. Event Calculus (EC) is a family of formalisms that model commonsense reasoning with a sound, logical basis. Previous attempts to mechanize reasoning using EC faced difficulties in the treatment of the continuous change in dense domains (e.g., time and other physical quantities), constraints among variables, default negation, and the uniform application of different inference methods, among others. We propose the use of s(CASP), a query-driven, top-down execution model for Predicate Answer Set Programming with Constraints, to model and reason using EC. We show how EC scenarios can be naturally and directly encoded in s(CASP) and how it enables deductive and abductive reasoning tasks in domains featuring constraints involving both dense time and dense fluents.


Full work available at URL: https://arxiv.org/abs/2106.14566




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Modeling and reasoning in event calculus using goal-directed constraint answer set programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097632)