Corpus ID: 8320935

# Tractable Epistemic Reasoning with Functional Fluents, Static Causal Laws and Postdiction

@article{Eppe2014TractableER,
title={Tractable Epistemic Reasoning with Functional Fluents, Static Causal Laws and Postdiction},
author={Manfred Eppe},
journal={ArXiv},
year={2014},
volume={abs/1403.0034}
}
Manfred EppeUniversity of Bremen, Germanymeppe@informatik.uni-bremen.de1. INTRODUCTIONEpistemic reasoning about action and change is a crucial requirement for systems that deal with incom-plete knowledge in the presence of abnormalities, unobservable processes, human-computer interactionand other real-world considerations. A particular type of epistemic inference which is required for di-agnosis tasks in an epistemic context is postiction (Eppe, 2013). Postdiction determines the conditionof an… Expand

#### References

SHOWING 1-10 OF 31 REFERENCES
An Epistemic Event Calculus for ASP-based Reasoning About Knowledge of the Past, Present and Future
• Computer Science, Mathematics
• LPAR
• 2013
We present a generalisation of the Event Calculus, specified in classical logic and implemented in ASP, that facilitates reasoning about non-binary-valued fluents in domains with non-deterministic,Expand
A Causal Theory of Ramifications and Qualifications
• Mathematics, Computer Science
• IJCAI
• 1995
This paper proposes a simple fixpoint condition defining the possible next states after performing an action, which guarantees minimal change between states, but also enforces the requirement that changes be "caused". Expand
Formalizing sensing actions A transition function based approach
• Mathematics, Computer Science
• Artif. Intell.
• 2001
A high-level action description language that allows specification of sensing actions and their effects in its domain description and allows queries with conditional plans is developed and provably correct translations of domain description in the language to axioms in first-order logic are given. Expand
Approximate Epistemic Planning with Postdiction as Answer-Set Programming
• Computer Science
• LPNMR
• 2013
A history-based approximation of the Possible Worlds Semantics $\mathcal{PWS}$ for reasoning about knowledge and action is proposed and its integration in a cognitive robotics framework for high-level control in a smart home is presented. Expand
Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
• Computer Science
• Theory and Practice of Logic Programming
• 2007
This work extends the 0-approximation of sensing actions and incomplete information in Son and Baral (2001) to action theories with static causal laws and proves its soundness with respect to the possible world semantics and presents an answer set programming based conditional planner, called ASCP, that is capable of generating both conformant plans and conditional plans. Expand
A Formal Theory of Knowledge and Action
Abstract : Most work on planning and problem solving within the field of artificial intelligence assumes that the agent has complete knowledge of all relevant aspects of the problem domain andExpand
A logic-based calculus of events
• Computer Science, Mathematics
• New Generation Computing
• 2009
We outline an approach for reasoning about events and time within a logic programming framework. The notion of event is taken to be more primitive than that of time and both are representedExpand
Contingent Planning via Heuristic Forward Search witn Implicit Belief States
• Mathematics, Computer Science
• ICAPS
• 2005
This paper proposes the targeted use of an additional relaxation, mapping the relaxed contingent problem into a relaxed conformant problem, and shows that the resulting planning system, Contingent-FF, is highly competitive with the state-of-the-art contingent planners POND and MBP. Expand
Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness
• Mathematics, Computer Science
• IJCAI
• 1999
It is shown that the planning problem in presence of incompleteness is indeed harder: it belongs to the next level of complexity hierarchy (in precise terms, it is Σ2P-complete), and under certain conditions, one of these approximations makes the problem NP-complete. Expand
Nonmonotonic causal theories
• Mathematics, Computer Science
• Artif. Intell.
• 2004
The nonmonotonic causal logic defined in this paper can be used to represent properties of actions, including actions with conditional and indirect effects, nondeterministic actions, and concurrentlyExpand