Nonmonotonic logic and temporal projection
Artificial Intelligence
Reasoning about action II: the qualification problem
Artificial Intelligence
Artificial intelligence and mathematical theory of computation
The acceptability semantics for logic programs
Proceedings of the eleventh international conference on Logic programming
Preferred answer sets for extended logic programs
Artificial Intelligence
The Qualification Problem: A solution to the problem of anomalous models
Artificial Intelligence
IEEE Intelligent Systems
A System for Defeasible Argumentation, with Defeasible Priorities
FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning
An Abductive Approach for Analysing Event-Based Requirements Specifications
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Some Alternative Formulations of the Event Calculus
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
Event Calculus Planning Through Satisfiability
Journal of Logic and Computation
Commonsense Reasoning
Issues in reasoning about interaction networks in cells: necessity of event ordering knowledge
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Epistemological problems of artificial intelligence
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
WSSL: a fluent calculus-based language for web service specifications
CAiSE'13 Proceedings of the 25th international conference on Advanced Information Systems Engineering
Hi-index | 0.00 |
We describe Modular-E (ME), a specialized, model-theoretic logic for reasoning about actions. ME is able to represent non-deterministic domains involving concurrency, static laws (constraints), indirect effects (ramifications), and narrative information in the form of action occurrences and observations along a time line. We give formal results which characterize ME's high degree of modularity and elaboration tolerance, and show how these properties help to separate out, and provide principled solutions to, different aspects of the qualification problem. In particular, we identify the endogenous qualification problem as the problem of properly accounting for highly distributed, and potentially conflicting, causal knowledge when reasoning about the effects of actions. We show how a comprehensive solution to the endogenous qualification problem helps simplify the exogenous qualification problem - the problem of reconciling conflicts between predictions about what should be true at particular times and actual observations. More precisely, we describe how ME is able to use straightforward default reasoning techniques to solve the exogenous qualification problem largely because its robust treatments of the frame, ramification and endogenous qualification problems combine into a particular characteristic of elaboration tolerance that we formally encapsulate as a notion of ''free will''.