Nonmonotonic causal theories
From MaRDI portal
Publication:814551
DOI10.1016/j.artint.2002.12.001zbMath1085.68161OpenAlexW2072046078MaRDI QIDQ814551
Norman McCain, Vladimir Lifschitz, Hudson Turner, Joohyung Lee, Enrico Giunchiglia
Publication date: 7 February 2006
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2002.12.001
Commonsense reasoningNonmonotonic reasoningKnowledge representationCausalityAction languagesReasoning about actions
Related Items
Bounded situation calculus action theories, Online Action Language $$o\mathcal {BC}$$+, Diagnostic Reasoning for Robotics Using Action Languages, Mobile Robot Planning Using Action Language $${\mathcal {BC}}$$ with an Abstraction Hierarchy, Causal Logic Programming, Extending Action Language $\mathcal{C}+$ by Formalizing Composite Actions, Considerations on Belief Revision in an Action Theory, Simulating Production Rules Using ACTHEX, Applications of Action Languages in Cognitive Robotics, Reformulating Action Language $\mathcal{C}$ + in Answer Set Programming, A Language for Default Reasoning about Actions, Action models for conditionals, Handling uncertainty and defeasibility in a possibilistic logic setting, Reasoning about actions with Temporal Answer Sets, Representing first-order causal theories by logic programs, A formal characterisation of Hamblin's action-state semantics, Active logic semantics for a single agent in a static world, A Probabilistic Extension of Action Language, A preferential semantics for causal reasoning about action, Answer Set Programming for Single-Player Games in General Game Playing, Some properties of system descriptions of, Functional completion, Probabilistic Event Calculus for Event Recognition, Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs, Representing hybrid automata by action language modulo theories, Hybrid conditional planning using answer set programming, Causal dynamic inference, Deriving conclusions from non-monotonic cause-effect relations, Updating action domain descriptions, Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs, Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language, An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints, Reasoning about non-immediate triggers in biological networks, Hybrid planning for challenging construction problems: an answer set programming approach, Reasoning about actions with \(\mathcal{EL}\) ontologies and temporal answer sets for DLTL, Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results, Strongly Equivalent Temporal Logic Programs, A weighted causal theory for acquiring and utilizing open knowledge, Agent strands in the action language \(n\mathcal C +\), Event calculus and temporal action logics compared, Loop formulas for circumscription, Comparing action descriptions based on semantic preferences, Multivalued action languages with constraints in CLP(FD), A declarative approach to distributed computing: Specification, execution and analysis, Undoing the effects of action sequences, t-DeLP: an argumentation-based temporal defeasible logic programming framework, Automated verification of state sequence invariants in general game playing, John McCarthy's legacy, \(\mathcal M\)odular-\(\mathcal E\) and the role of elaboration tolerance in solving the qualification problem, A unifying action calculus, Predicting causality ascriptions from background knowledge: model and experimental validation, A probabilistic interval-based event calculus for activity recognition, plasp 3: Towards Effective ASP Planning, Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +, CCalc, Inductive situation calculus, Argumentation in artificial intelligence, An executable specification of a formal argumentation protocol, Metatheory of actions: beyond consistency, Performability of actions, First-order stable model semantics with intensional functions, A paraconsistent approach to actions in informationally complex environments, Engineering an Incremental ASP Solver, Distant causation in \(\mathcal C+\), From knowledge-based programs to graded belief-based programs. I: On-line reasoning, Representing the Zoo World and the Traffic World in the language of the Causal Calculator, Conditional logic of actions and causation, A causal approach to nonmonotonic reasoning
Cites Work
- A logic-based calculus of events
- Representing the Zoo World and the Traffic World in the language of the Causal Calculator
- Nonmonotonic logic and temporal projection
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Ramification and causality
- TALplanner: A temporal logic based forward chaining planner
- Answer set programming and plan generation
- Logic programs with stable model semantics as a constraint programming paradigm
- A logic of universal causation
- STRIPS: A new approach to the application of theorem proving to problem solving
- Representing action and change by logic programs
- ADL and the State-Transition Model of Action
- Reasoning about effects of concurrent actions
- Representing actions in logic programs and default theories a situation calculus approach
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item