Titlebook: Logics in Artificial Intelligence; 13th European Confer Luis Fariñas Cerro,Andreas Herzig,Jérôme Mengin Conference proceedings 2012 Springe

Antecedent

Conditional Epistemic Planningve a language of conditional plans. Translating this language to standard DEL gives verification of both strong and weak plans via model checking. In addition to plan verification, we provide a tableau-inspired algorithm for synthesising plans, and show this algorithm to be terminating, sound and complete.

GRIPE

The Complexity of One-Agent Refinement Modal Logicatisfiability, the latter being a well-known .-complete problem. More precisely, we establish that .-satisfiability is complete for the complexity class ., i.e., the class of problems solvable by alternating Turing machines running in single exponential time but only with a polynomial number of alternations (note that .⊆ .⊆ .).

Fantasy

BARB

LVAD360

Conflict-Tolerant Semantics for Argumentation Frameworkso-one relationship between extensions and labelings of conflict-free semantics is carried on to a similar correspondence between the extended approaches for providing conflict-tolerant semantics. Thus, in our setting as well, these are essentially two points of views for the same thing.

anthropologist

Generalized DEL-Sequents and show that these inference problems are NEXPTIME-complete. We extend our results to the cases where the accessibility relation is serial and reflexive and illustrate them with the coordinated attack problem.

EWER

Three-Valued Logics for Incomplete Information and Epistemic Logicf modal depth 1, with modalities in front of literals), preserving all tautologies and inference rules. We study in particular, the translation of Kleene, Gödel, Łukasiewicz and Nelson logics. This work enables us to lay bare the limited expressive power of three-valued logics in uncertainty management.

Extort

Foolproof

concise

978-3-642-33352-1Springer-Verlag Berlin Heidelberg 2012