000 04409nam a22006255i 4500
001 978-3-540-44404-6
003 DE-He213
005 20240423132430.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 _a9783540444046
_9978-3-540-44404-6
024 7 _a10.1007/3-540-44404-1
_2doi
050 4 _aQA8.9-10.3
072 7 _aPBCD
_2bicssc
072 7 _aPBC
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aPBCD
_2thema
072 7 _aPBC
_2thema
082 0 4 _a511.3
_223
245 1 0 _aLogic for Programming and Automated Reasoning
_h[electronic resource] :
_b7th International Conference, LPAR 2000 Reunion Island, France, November 6-10, 2000 Proceedings /
_cedited by Michel Parigot, Andrei Voronkov.
250 _a1st ed. 2000.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2000.
300 _aXIV, 490 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1955
505 0 _aNonmononic reasoning -- On the Complexity of Theory Curbing -- Descriptive complexity -- Graph Operations and Monadic Second-Order Logic: A Survey -- Efficient First Order Functional Program Interpreter with Time Bound Certifications -- Specification and automatic proof-assistants -- Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System -- Behavioural Constructor Implementation for Regular Algebras -- An Extensible Proof Text Editor -- A Tactic Language for the System Coq -- Theorem proving -- Proof Simplification for Model Generation and Its Applications -- Have SPASS with OCC1N = g -- Verification -- Compiling and Verifying Security Protocols -- Equational Binary Decision Diagrams -- A PVS Proof Obligation Generator for Lustre Programs -- Logic programming and CLP -- Efficient Structural Information Analysis for Real CLP Languages -- Playing Logic Programs with the Alpha-Beta Algorithm -- Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison -- Nonclassical logics and lambda calculus -- Quantified Propositional Gödel Logics -- Proof-Search in Implicative Linear Logic as a Matching Problem -- A New Model Construction for the Polymorphic Lambda Calculus -- Church’s Lambda Delta Calculus -- Logic and databases -- Querying Inconsistent Databases -- How to Decide Query Containment under Constraints Using a Description Logic -- Program analysis -- Static Reduction Analysis for Imperative Object Oriented Languages -- An Abstract Interpretation Approach to Termination of Logic Programs -- Using an Abstract Representation to Specialize Functional Logic Programs -- Binding-Time Analysis by Constraint Solving -- Mu-calculus -- Efficient Evaluation Methods for Guarded Logics and Datalog LITE -- On the Alternation-Free Horn ?-Calculus.-Planning and reasoning about actions -- The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus -- Solving Planning Problems by Partial Deduction -- A Kripkean Semantics for Dynamic Logic Programming.
650 0 _aMathematical logic.
650 0 _aCompilers (Computer programs).
650 0 _aArtificial intelligence.
650 0 _aComputer science.
650 0 _aMachine theory.
650 1 4 _aMathematical Logic and Foundations.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aArtificial Intelligence.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aParigot, Michel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aVoronkov, Andrei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540412854
776 0 8 _iPrinted edition:
_z9783662162378
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1955
856 4 0 _uhttps://doi.org/10.1007/3-540-44404-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187696
_d187696