Logics in Artificial Intelligence: 10th European Conference, JELIA 2006, Liverpool, UK, September 13-15, 2006, ProceedingsMichael Fisher This book constitutes the refereed proceedings of the 10th European Conference on Logics in Artificial Intelligence, JELIA 2006. The 34 revised full papers and 12 revised tool description papers presented together with 3 invited talks were carefully reviewed and selected from 96 submissions. The papers cover a range of topics within the remit of the Conference, such as logic programming, description logics, non-monotonic reasoning, agent theories, automated reasoning, and machine learning. |
Contents
From Inductive Logic Programming to Relational Data Mining | 1 |
A Declarative Approach to Solving Search | 15 |
An EventConditionAction Logic Programming Language | 29 |
DistanceBased Repairs of Databases | 43 |
Natural Deduction Calculus for LinearTime Temporal Logic | 56 |
A STITExtension of ATL | 69 |
On the Logic and Computation of Partial Equilibrium Models | 82 |
Decidable Fragments of Logic Programming with Value Invention | 95 |
Introducing Attempt in a Modal Logic of Intentional Action | 280 |
On Herbrands Theorem for Intuitionistic Logic | 293 |
Ambiguity Propagating Defeasible Logic and the WellFounded | 306 |
Hierarchical Argumentation | 319 |
Antiprenexing and Prenexing for Modal Logics | 333 |
A BottomUp Method for the Deterministic Horn Fragment | 346 |
Fuzzy Answer Set Programming | 359 |
Reasoning About an Agent Based on Its Revision History with Missing | 373 |
On the Issue of Reinstatement in Argumentation | 111 |
Comparing Action Descriptions Based on Semantic Preferences | 124 |
Modal Logics of Negotiation and Preference | 138 |
Representing Action Domains with NumericValued Fluents | 151 |
Model Representation over Finite and Infinite Signatures | 164 |
Deciding Extensions of the Theory of Arrays by Integrating Decision | 177 |
Analytic Tableau Calculi for KLM Rational Logic R | 190 |
On the Semantics of Logic Programs with Preferences | 203 |
A Modularity Approach for a Fragment of ALC | 216 |
Whatever You Say | 229 |
Automatic Deductive Synthesis of Lisp Programs in the System | 242 |
Reasoning About Actions Using Description Logics with General | 266 |
Knowledge Base Revision in Description Logics | 386 |
Incomplete Knowledge in Hybrid Probabilistic Logic Programs | 399 |
A Formal Analysis of KGP Agents | 413 |
Irrelevant Updates and Nonmonotonic Assumptions | 426 |
The Case | 439 |
Representing Causal Information About a Probabilistic Process | 452 |
A Tool to Facilitate Agent Deliberation | 465 |
An Implementation of a Lightweight Argumentation Engine for Agent | 469 |
A Tool for Solving SAT Related Optimization Problems | 485 |
A Slicing Tool for Lazy Functional Logic Programs | 498 |
Tableaux and Resolution for Finite Abduction | 511 |
Other editions - View all
Common terms and phrases
action additional agent algorithm allow answer set appear application approach argumentation assume atoms attempt axioms basic belief calculus called clauses complexity Computer concept consider consistent constructed contains context corresponding database deal decision default defined Definition denote dependency described disjunctive effects equivalent event example execution exists expression extension finite first fluent formal formula framework function given goal ground holds implemented inference input instance interpretation introduce knowledge base labelling language literals logic programs means method minimal modal Note notion observation obtained operator perform positive possible predicate preferred presented probabilistic problem Proc proof properties proposed propositional query reasoning relation represented respectively restrictions result revision role rules satisfied satisfy semantics sequence stable step strategy symbols tableau Theorem theory true University updates valid variables