A Production Rule-Based Framework for Causal and Epistemic Reasoning Theodore Patkos, Abdelghani Chibani, Dimitris Plexousakis, Yacine Amirat ({patkos, chibani, amirat}@u-pec.fr, [email protected]) Laboratoire Images Signaux et Systèmes Intelligents (LISSI) University of Paris-Est Creteil, Paris Institute of Computer Science – Foundation for Research and Technology Hellas (FO.R.T.H.) 6 th International Symposium on Rules (RuleML’12), Research Work supported by the ITEA 2 EU Projects: A2NETS, PREDYKOT
29
Embed
Ruleml2012 - A production rule-based framework for causal and epistemic reasoning
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
A Production Rule-Based Framework for Causal and Epistemic Reasoning
• The objective is to express the dynamics of the world
• Therefore always include a more or less implicit general notions of time,
change and causality.
• Action Theories automate the
process of commonsense reasoning, in order to • predict the outcome of a given
action sequence • explain observations • find a situation in which certain
goal conditions are met.
RuleML 12 6
7
Background – Commonsense phenomena
• Related issues • Representation • Effects of Events • Indirect Effects of Events (Ramification problem) • Context-dependent Effects • Non-deterministic Effects • Concurrent Events • Preconditions • Inertia (Frame problem) • Actions with duration • Delayed Effects and Continuous Change • Default Reasoning (Qualification problem) • …
RuleML 12 7
Background – Discrete Time Event Calculus
• The EC distinguishes three kinds of objects – events, fluents and timepoints. To do this, it appeals to a sorted first-order language.
• Commonsense Law of Inertia: things tend to persist unless affected by some event.
Positive and Negative Effect Axioms (Σ)
fi C [HoldsAt(fi,t)] Initiates(e,f,t)
fi C [HoldsAt(fi,t)] Terminates(e,f,t)
State Constraints (Ψ) i [HoldsAt(fi,t)] HoldsAt(f,t)
EC Predicates
• HoldsAt(f,t)
• ReleasedAt(f,t)
• Happens(e,t)
• Initiates(e,f,t)
• Terminates(e,f,t)
• Releases(e,f,t)
RuleML 12 8
Epistemic Action Theories
• Epistemic (modal) logic: An agent is
said to know a fact if this is true in all possible worlds.
RuleML 12 9
Epistemic and Causal Reasoning
• Action theories that do not model time explicitly have been extended to reason about knowledge in a straightforward manner. • The Situation Calculus
[Moore 1985, Scherl&Levesque 2003]
• The Fluent Calculus [Thielscher 2000]
• The Action Language Ak [Lobo et al. 2001]
• For example, suppose an action E that makes F true if F’ is true:
RuleML 12 10
Theodore Patkos et al. 11
DECKT – Hidden Causal Dependencies
• We developed a unified formal theory for epistemic, causal and temporal reasoning
• able to express diverse phenomena of commonsense reasoning, about knowledge
• still being computationally feasible.
E
RuleML 12 11
Outline
• Overview
• (Epistemic) Action Theories
• Production Rule-based Framework
• Application Domain
• Conclusions
RuleML 12 12
13
EC Jess-based Reasoner
RuleML 12 13
14
Requirements and Challenges
• There exist different implementations of the Event Calculus for offline reasoning, • but certain of its features are not appropriate for runtime execution
• DECKT has been designed for practical implementations, • Therefore introduces added features not typically met in Event Calculus
(e.g., reification of formulas, time-dependent meta axioms for handling of HCDs)
RuleML 12 14
15
DECKT Time-Dependent Meta-Axioms
fi C [HoldsAt(fi,t)] Initiates(e,f,t)
• Event e initiates f if f’ is true • (KT6.1.1) handles the case of
unknown preconditions
• Circumscription at every timepoint would be inefficient.
e
RuleML 12 15
16
Production rules with high level structures
• Features that we employ with rule-based reasoning involve • Dynamic rule construction to accommodate HCDs • Semi-destructive update of the KB, where applicable • NaF, rather than circumscription • List handling • Salience values for conflict resolution (e.g., concurrent events). • Numerical manipulations
RuleML 12 16
17
• Released fluents and NaF
Operational semantics – Model generator
Sensing and
Acting
KB
DEC/DECKT axioms (destructive update)
Ramifications (state constraints)
Triggered events
Alternative Models
RuleML 12 17
18
Non-Epistemic Reasoning Cycle
KB of Fluents
Released
Released
Released Constrained
Effect axioms
fi C[HoldsAt(fi,t)] Initiates(e,f,t) fi C [HoldsAt(fi,t)] Terminates(e,f,t)
State Constrains
i [HoldsAt(fi,t)] HoldsAt(f,t)
.
.
.
Trigger axioms
.
.
.
.
.
.
fi C [HoldsAt(f1,t)]
Happens(e,t)
Sensing
X
X X
RuleML 12 18
T=t T=t+1
19
Epistemic Reasoning Cycle
KB of Epistemic
Fluents
Effect axioms
State Constrains
Trigger axioms
Sensing
RuleML 12 19
T=t T=t+1
20
An Informal Note on Complexity
• The logical theories set a lower bound as to how efficient an
implementation can be.
• The predominant computational complexity factor… • for the non-epistemic case is the number of released fluents • for the epistemic case is the set of HCDs
• Query answering on ground facts is of linear complexity.
• Jess pattern matching depends on the syntactic form of rules. • Ranges from O(p) to O(pn)
RuleML 12 20
21
Framework overview
Event Calculus • Reasoning about action and time • Solution to problems (frame,