Ulrich Furbach Livres

This book constitutes the refereed proceedings of the Third International Joint Conference on Automated Reasoning, IJCAR 2006, held in Seattle, WA, USA in August 2006 as part of the 4th Federated Logic Conference, FLoC 2006. IJCAR 2006 is a merger of CADE, FroCoS, FTP, TABLEAUX, and TPHOLs. The 41 revised full research papers and 8 revised system descriptions presented together with 3 invited papers and a summary of a systems competition were carefully reviewed and selected from a total of 152 submissions. The papers address the entire spectrum of research in automated reasoning including formalization of mathematics, proof theory, proof search, description logics, interactive proof checking, higher-order logic, combination methods, satisfiability procedures, and rewriting. The papers are organized in topical sections on proofs, search, higher-order logic, proof theory, search, proof checking, combination, decision procedures, CASC-J3, rewriting, and description logic.

The content covers a range of topics including invited talks on hierarchy in fluid construction grammars and description logics in ontology applications. It discusses knowledge representation and reasoning, introducing a new n-ary existential quantifier in description logics, and explores subsumption related to hybrid TBoxes. The annotation also addresses dependency calculus for reasoning in general point relation algebra and the temporalization of spatial calculi through generalized neighborhood graphs. In machine learning, it highlights the design of geologic structure models using case-based reasoning, the application of constrained linear regression models for interval-valued data prediction, and the use of stochastic learning weak estimators for training patterns with non-stationary distributions. Noise robustness through inverse mutations is also mentioned. The diagnosis section presents the development of adaptable fault detection algorithms for induction motors, computing optimal action sequences via niche genetic algorithms, and automatic abstraction of time-varying system models for model-based diagnosis. In neural networks, it includes neuro-fuzzy Kolmogorov’s networks for time series prediction and optimal power distribution network design using multiobjective genetic algorithms. Planning topics cover metaheuristics for late work minimization, optimal disassembly scheduling algorithms, and controlled reachabi

Inhaltsverzeichnis0 Einführung.1 Hornklausellogik als Programmiersprache.1.1 Die Sprache der Hornklauseln: Syntax und Semantik von HCL.1.2 Behandlung der Gleichheit.1.3 HCL-Programme mit Gleichheit.2 Die Kombination von HCL und funktionalen Sprachen.2.1 Formale Spezifikation der Kombination.2.2 Erweiterte Unifikation.2.3 Erweiterte Resolution.2.4 Korrektheit.2.5 Vollständigkeit.2.6 Beispiele aus der Literatur.3 Das FHCL-Programmiersystem.3.1 Die Sprache.3.2 Erweiterte Unifikation und Resolution in FHCL.3.3 Inverse Funktionen.3.4 Systemumgebung.3.5 Ein FHCL-Beispiel.4 Parallelisierung von HCL.4.1 ODER-Parallelität.4.2 FHCL auf Mehrprozessorsystemen.5 Termersetzungssysteme im FHCL-Schema.5.1 Termersetzungssysteme als funktionale Sprache.5.2 Von Hornklausellogik zu Termersetzungssystemen.5.3 Einordnung ins FHCL-Schema und Diskussion.6 Sortierte Hornklauseln.6.1 Mehrsortigkeit.6.2 Sortenhierarchien.6.3 Syntaktischer Zucker.6.4 Attribute und Vererbung.6.5 Gleichungen vs. Relativierung.7 Eine Anwendung: Smoothsort.7.1 Transformationelle Programmentwicklung.7.2 Entwicklung von Smoothsort.7.3 Lehren daraus.8 Zusammenfassung.9 Anhang.Literatur.Sachwortverzeichnis.