Approximate postdictive reasoning with answer set programming
From MaRDI portal
Recommendations
- Approximate Epistemic Planning with Postdiction as Answer-Set Programming
- Answer set programming based on propositional satisfiability
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- scientific article; zbMATH DE number 1882048
- Answer set programming in intuitionistic logic
- Declarative Problem Solving Using Answer Set Semantics
Cites work
- scientific article; zbMATH DE number 89002 (Why is no real title available?)
- scientific article; zbMATH DE number 3359806 (Why is no real title available?)
- A history based approximate epistemic action theory for efficient postdictive reasoning
- Approximate Epistemic Planning with Postdiction as Answer-Set Programming
- Cplus2ASP: computing action language \({\mathcal C}+\) in answer set programming
- Event Calculus Reasoning Through Satisfiability
- Formalizing sensing actions -- a transition function based approach
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Knowledge, action, and the frame problem
- Reasoning and planning with sensing actions, incomplete information, and static causal laws using 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
Cited in
(4)- Approximate Epistemic Planning with Postdiction as Answer-Set Programming
- A computational framework for conceptual blending
- Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\)
- A history based approximate epistemic action theory for efficient postdictive reasoning
This page was built for publication: Approximate postdictive reasoning with answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893596)