Description
Logics have, for many years, laid claim to providing a formal basis for the study of arti?cial intelligence. With the depth and maturity of methodologies, formalisms, procedures, implementations, and their applications available today, this claim is stronger than ever, as witnessed by increasing amount and range of publications in the area, to which the present proceedings accrue. The European series of Workshops on Logics in Arti?cial Intelligence (or Journees Europeennes sur la Logique en Intelligence Arti?cielle – JELIA) began in response to the need for a European forum for the discussion of emerging work in this burgeoning ?eld. JELIA 2000 is the seventh such workshop in the series, following the ones held in Rosco?, France (1988); Amsterdam, Netherlands (1990); Berlin, Germany (1992); York, U.K. (1994); Evora, Portugal (1996); and Dagstuhl, Germany (1998). JELIA 2000 will take place in M alaga, Spain, from 29 September to 2 – tober 2000. The workshop is organized and hosted by the Research Group of Mathematics Applied to Computing of the Department of Applied Mathematics of the University of Mal aga. As in previous workshops, the aim is to bring together researchers involved in all aspects of logic in arti?cial intelligence. Additional sponsorship was provided by the ESPRIT NOE Compulog-Net. Invited Talks.- ‘On Being Informed’: Update Logics for Knowledge States.- Considerations on Updates of Logic Programs.- The Approach: Integrating Object Oriented Design and Formal Verification.- Semi-qualitative Reasoning about Distances: A Preliminary Report.- Regular Contributions.- Hybrid Probabilistic Logic Programs as Residuated Logic Programs.- Topo-distance: Measuring the Difference between Spatial Patterns.- An Abductive Mechanism for Natural Language Processing Based on Lambek Calculus.- Capturing Stationary and Regular Extensions with Reiter’s Extensions.- Representing the Process Semantics in the Event Calculus.- Declarative Formalization of Strategies for Action Selection: Applications to Planning.- An Algorithmic Approach to Recover Inconsistent Knowledge-Bases.- Acceptance Without Minimality.- Reduction Theorems for Boolean Formulas Using ?-Trees.- Simultaneous Rigid Sorted Unification.- Partially Adaptive Code Trees.- On Dialogue Systems with Speech Acts, Arguments, and Counterarguments.- Credulous and Sceptical Argument Games for Preferred Semantics.- A General Approach to Multi-agent Minimal Knowledge.- A Modal Logic for Network Topologies.- Avoiding Logical Omniscience by Using Subjective Situations.- Multi-agent Logic.- New Tractable Cases in Default Reasoning from Conditional Knowledge Bases.- Monodic Epistemic Predicate Logic.- Updates plus Preferences.- A Framework for Belief Update.- A Compilation of Brewka and Eiter’s Approach to Prioritization.- A Logic for Modeling Decision Making with Dynamic Preferences.
