000 06429nam a22006375i 4500
001 978-3-642-45221-5
003 DE-He213
005 20240730191731.0
007 cr nn 008mamaa
008 131205s2013 gw | s |||| 0|eng d
020 _a9783642452215
_9978-3-642-45221-5
024 7 _a10.1007/978-3-642-45221-5
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aLogic for Programming, Artificial Intelligence, and Reasoning
_h[electronic resource] :
_b19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013, Proceedings /
_cedited by Ken McMillan, Aart Middeldorp, Andrei Voronkov.
250 _a1st ed. 2013.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXIV, 794 p. 178 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8312
505 0 _aAn Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics -- May-Happen-in-Parallel Analysis for Priority-Based Scheduling -- The Complexity of Clausal Fragments of LTL -- A Semantic Basis for Proof Queries and Transformations -- Expressive Path Queries on Graphs with Data -- Proving Infinite Satisfiability -- SAT-Based Preprocessing for MaxSAT -- Dynamic and Static Symmetry Breaking in Answer Set Programming -- HOL Based First-Order Modal Logic Provers -- Resourceful Reachability as HORN-LA -- A Seligman-Style Tableau System -- Comparison of LTL to Deterministic Rabin Automata Translators -- Tree Interpolation in Vampire -- Polarizing Double-Negation Translations -- Revisiting the Equivalence of Shininess and Politeness -- Towards Rational Closure for Fuzzy Logic: The Case of Propositional Gödel Logic -- Multi-objective Discounted Reward Verification in Graphs and MDPs -- Description Logics, Rules and Multi-context Systems -- Complexity Analysis in Presence of Control Operators and Higher-Order Functions -- Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo -- Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving -- Verifying Temporal Properties in Real Models -- A Graphical Language for Proof Strategies -- A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus -- Relaxing Synchronization Constraints in Behavioral Programs -- Characterizing Subset Spaces as Bi-topological Structures -- Proof-Pattern Recognition and Lemma Discovery in ACL2 -- Semantic A-translations and Super-Consistency Entail Classical Cut Elimination -- Blocked Clause Decomposition -- Maximal Falsifiability: Definitions, Algorithms, and Applications -- Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning -- On QBF Proofs and Preprocessing -- Partial Backtracking in CDCL Solvers -- Lemma Mining over HOL Light -- On Module-Based Abstraction and Repair of Behavioral Programs -- Predictionand Explanation over DL-Lite Data Streams -- Forgetting Concept and Role Symbols in ALCH-Ontologies -- Simulating Parity Reasoning -- Herbrand Theorems for Substructural Logics -- On Promptness in Parity Games -- Defining Privacy Is Supposed to Be Easy -- Reachability Modules for the Description Logic SRIQ -- An Event Structure Model for Probabilistic Concurrent Kleene Algebra -- Three SCC-Based Emptiness Checks for Generalized Büchi Automata -- PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification -- Incremental Tabling for Query-Driven Propagation of Logic Program Updates -- Tracking Data-Flow with Open Closure Types -- Putting Newton into Practice: A Solver for Polynomial Equations over Semirings -- System Description: E 1.8 -- Formalization of Laplace Transform Using the Multivariable Calculus Theory of HOL-Light -- On Minimality and Integrity Constraints in Probabilistic Abduction -- POLAR: A Framework for Proof Refactoring.
520 _aThis book constitutes the proceedings of the 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR-19, held in December 2013 in Stellenbosch, South Africa. The 44 regular papers and 8 tool descriptions and experimental papers included in this volume were carefully reviewed and selected from 152 submissions. The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields and to exchange ideas in a scientifically emerging part of the world.
650 0 _aSoftware engineering.
_94138
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9147123
650 0 _aComputer programming.
_94169
650 0 _aCompilers (Computer programs).
_93350
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9147124
650 2 4 _aProgramming Techniques.
_9147125
650 2 4 _aCompilers and Interpreters.
_931853
700 1 _aMcMillan, Ken.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9147126
700 1 _aMiddeldorp, Aart.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9147127
700 1 _aVoronkov, Andrei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9147128
710 2 _aSpringerLink (Online service)
_9147129
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642452208
776 0 8 _iPrinted edition:
_z9783642452222
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8312
_9147130
856 4 0 _uhttps://doi.org/10.1007/978-3-642-45221-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93878
_d93878