Amazon cover image
Image from Amazon.com

Logic programming and automated reasoning : 4th international conference, LPAR '93, St. Petersburg, Russia, July 1320, 1993 : proceedings / Andrei Voronkov (ed.).

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 698. | Lecture notes in computer science. Lecture notes in artificial intelligence.Publisher: Berlin : SpringerVerlag, ©1993Description: 1 online resource (XIII, 386 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540478300
  • 3540478302
  • 3540569448
  • 9783540569442
Other title:
  • LPAR '93
Subject(s): Genre/Form: Additional physical formats: Print version:: Logic programming and automated reasoningDDC classification:
  • 006.3 20
LOC classification:
  • QA76.63 .I55 1993
Other classification:
  • 54.72
  • 54.51
  • 54.10
  • 54.71
  • *00B25
  • 68-06
  • 68N17
  • 68T15
  • 68T27
Online resources:
Contents:
Entailment and disentailment of order-sorted feature constraints -- Computing extensions of default logic -- Preliminary report -- Prolog with arrays and bounded quantifications -- Linear 0-1 inequalities and extended clauses -- Search space pruning by checking dynamic term growth -- A proof search system for a modal substructural logic based on labelled deductive systems -- Consistency checking of automata functional specifications -- Yet another application for Toupie: Verification of mutual exclusion algorithms -- Parsing with DCG-terms -- A first order resolution calculus with symmetries -- Ordered paramodulation and resolution as decision procedure -- Static analysis of Prolog with cut -- A new type theory for representing logics -- Verification of Switch-level designs with many-valued logic -- Deciding in HFS-theory via linear integer programming -- The completion of typed logic programs and SLDNF-resolution -- Increasing the versatility of heuristic based theorem provers -- Sequentialization of parallel logic programs with mode analysis -- Refinements and extensions of model elimination -- Executable specifications based on dynamic algebras -- Generic resolution in propositional modal systems -- Optimized translation of multi modal logic into predicate logic -- Default reasoning with a constraint resolution principle -- Non-clausal deductive techniques for computing prime implicants and prime implicates -- Unification under one-sided distributivity with a multiplicative unit -- Unification in Order-Sorted Logic with Term Declarations -- Extracting inheritance hierarchies from Prolog programs: A system based on the inference of type relations -- A comparison of mechanisms for avoiding repetition of subdeductions in chain format linear deduction systems -- Neutralization and preemption in extended logic programs -- MULTLOG: A system for axiomatizing many-valued logics -- SKIL: A system for programming with proofs -- Reasoning about the reals: the marriage of HOL and maple -- System description of LAMBDALG -- Mixing metafor -- A complete axiom system for isomorphism of types in closed categories -- Reasoning, modeling, and component-based technology.
Action note:
  • digitized 2022. HathiTrust Digital Library committed to preserve
Summary: 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."
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references.

Online resource; title from PDF title page (SpringerLink, viewed October 16, 2013).

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."

Entailment and disentailment of order-sorted feature constraints -- Computing extensions of default logic -- Preliminary report -- Prolog with arrays and bounded quantifications -- Linear 0-1 inequalities and extended clauses -- Search space pruning by checking dynamic term growth -- A proof search system for a modal substructural logic based on labelled deductive systems -- Consistency checking of automata functional specifications -- Yet another application for Toupie: Verification of mutual exclusion algorithms -- Parsing with DCG-terms -- A first order resolution calculus with symmetries -- Ordered paramodulation and resolution as decision procedure -- Static analysis of Prolog with cut -- A new type theory for representing logics -- Verification of Switch-level designs with many-valued logic -- Deciding in HFS-theory via linear integer programming -- The completion of typed logic programs and SLDNF-resolution -- Increasing the versatility of heuristic based theorem provers -- Sequentialization of parallel logic programs with mode analysis -- Refinements and extensions of model elimination -- Executable specifications based on dynamic algebras -- Generic resolution in propositional modal systems -- Optimized translation of multi modal logic into predicate logic -- Default reasoning with a constraint resolution principle -- Non-clausal deductive techniques for computing prime implicants and prime implicates -- Unification under one-sided distributivity with a multiplicative unit -- Unification in Order-Sorted Logic with Term Declarations -- Extracting inheritance hierarchies from Prolog programs: A system based on the inference of type relations -- A comparison of mechanisms for avoiding repetition of subdeductions in chain format linear deduction systems -- Neutralization and preemption in extended logic programs -- MULTLOG: A system for axiomatizing many-valued logics -- SKIL: A system for programming with proofs -- Reasoning about the reals: the marriage of HOL and maple -- System description of LAMBDALG -- Mixing metafor -- A complete axiom system for isomorphism of types in closed categories -- Reasoning, modeling, and component-based technology.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified]: HathiTrust Digital Library. 2022. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2022. HathiTrust Digital Library committed to preserve pda MiAaHDL

Powered by Koha