LPAR is an international conference series aimed at bringing together researchers interested in logic programming and automated reasoning. The research in logic programming grew out of the research in automated reasoning in the early 1970s. Later, the implementation techniques known from logic programming were used in implementing theorem proving systems. Results from both fields applied to deductive databases. This volume contains the proceedings of LPAR '93, which was organized by the Russian Association for Logic Programming. The volume contains 35 contributed papers selected from 84 submissions, together with an invited paper by Peter Wegner entitled "Reasoning versus modeling in computer science".
Author(s): Hassan Aït-Kaci, Andreas Podelski (auth.), Andrei Voronkov (eds.)
Series: Lecture Notes in Computer Science 698 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1993
Language: English
Pages: 394
Tags: Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Mathematical Logic and Foundations
Entailment and disentailment of order-sorted feature constraints....Pages 1-18
Computing extensions of default logic — Preliminary report....Pages 19-27
Prolog with arrays and bounded quantifications....Pages 28-39
Linear 0–1 inequalities and extended clauses....Pages 40-51
Search space pruning by checking dynamic term growth....Pages 52-63
A proof search system for a modal substructural logic based on labelled deductive systems....Pages 64-75
Consistency checking of automata functional specifications....Pages 76-85
Yet another application for Toupie: Verification of mutual exclusion algorithms....Pages 86-97
Parsing with DCG-terms....Pages 98-109
A first order resolution calculus with symmetries....Pages 110-121
Ordered paramodulation and resolution as decision procedure....Pages 122-133
Static analysis of Prolog with cut....Pages 134-145
A new type theory for representing logics....Pages 146-157
Verification of Switch-level designs with many-valued logic....Pages 158-169
Deciding in HFS-theory via linear integer programming....Pages 170-181
The completion of typed logic programs and SLDNF-resolution....Pages 182-193
Increasing the versatility of heuristic based theorem provers....Pages 194-204
Sequentialization of parallel logic programs with mode analysis....Pages 205-216
Refinements and extensions of model elimination....Pages 217-228
Executable specifications based on dynamic algebras....Pages 229-240
Generic resolution in propositional modal systems....Pages 241-252
Optimized translation of multi modal logic into predicate logic....Pages 253-264
Default reasoning with a constraint resolution principle....Pages 265-276
Non-clausal deductive techniques for computing prime implicants and prime implicates....Pages 277-288
Unification under one-sided distributivity with a multiplicative unit....Pages 289-300
Unification in Order-Sorted Logic with Term Declarations....Pages 301-308
Extracting inheritance hierarchies from Prolog programs: A system based on the inference of type relations....Pages 309-320
A comparison of mechanisms for avoiding repetition of subdeductions in chain format linear deduction systems....Pages 321-332
Neutralization and preemption in extended logic programs....Pages 333-344
MULTLOG: A system for axiomatizing many-valued logics....Pages 345-347
SKIL: A system for programming with proofs....Pages 348-350
Reasoning about the reals: the marriage of HOL and maple....Pages 351-353
System description of LAMBDALG....Pages 354-356
Mixing metafor....Pages 357-359
A complete axiom system for isomorphism of types in closed categories....Pages 360-371
Reasoning, modeling, and component-based technology....Pages 372-386
