Approximate postdictive reasoning with answer set programming

DOI10.1016/j.jal.2015.08.002zbMath1457.68255WikidataQ62623663 ScholiaQ62623663MaRDI QIDQ893596

Mehul Bhatt, Manfred Eppe

Publication date: 19 November 2015

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2015.08.002

zbMATH Keywords

commonsense reasoning; answer set programming; epistemic reasoning; action and change

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68T30: Knowledge representation

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68N17: Logic programming

Related Items

A history based approximate epistemic action theory for efficient postdictive reasoning, Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\), A computational framework for conceptual blending

Uses Software

• Gringo

Cites Work

• Unnamed Item
• Unnamed Item
• Knowledge, action, and the frame problem
• A history based approximate epistemic action theory for efficient postdictive reasoning
• Cplus 2ASP: Computing Action Language ${\cal C}$ + in Answer Set Programming
• Approximate Epistemic Planning with Postdiction as Answer-Set Programming
• Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
• Representing action and change by logic programs
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Event Calculus Reasoning Through Satisfiability
• Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
• Formalizing sensing actions -- a transition function based approach