000 05952nam a22005295i 4500
001 u375258
003 SIRSI
005 20160812084315.0
007 cr nn 008mamaa
008 101004s2010 gw | s |||| 0|eng d
020 _a9783642162428
_9978-3-642-16242-8
040 _cMX-MeUAM
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
082 0 4 _a006.3
_223
100 1 _aFermüller, Christian G.
_eeditor.
245 1 0 _aLogic for Programming, Artificial Intelligence, and Reasoning
_h[recurso electrónico] :
_b17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings /
_cedited by Christian G. Fermüller, Andrei Voronkov.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXII, 656p. 83 illus.
_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 Computer Science,
_x0302-9743 ;
_v6397
505 0 _aThe Complexity of Partial-Observation Parity Games -- Awareness in Games, Awareness in Logic -- Human and Unhuman Commonsense Reasoning -- Gödel Logics – A Survey -- Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces -- Extended Computation Tree Logic -- Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics -- SAT Encoding of Unification in -- Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers -- Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models -- Characterising Space Complexity Classes via Knuth-Bendix Orders -- Focused Natural Deduction -- How to Universally Close the Existential Rule -- On the Complexity of the Bernays-Schönfinkel Class with Datalog -- Magically Constraining the Inverse Method Using Dynamic Polarity Assignment -- Lazy Abstraction for Size-Change Termination -- A Syntactical Approach to Qualitative Constraint Networks Merging -- On the Satisfiability of Two-Variable Logic over Data Words -- Generic Methods for Formalising Sequent Calculi Applied to Provability Logic -- Characterising Probabilistic Processes Logically -- fCube: An Efficient Prover for Intuitionistic Propositional Logic -- Superposition-Based Analysis of First-Order Probabilistic Timed Automata -- A Nonmonotonic Extension of KLM Preferential Logic P -- On Strong Normalization of the Calculus of Constructions with Type-Based Termination -- Aligators for Arrays (Tool Paper) -- Clause Elimination Procedures for CNF Formulas -- Partitioning SAT Instances for Distributed Solving -- Infinite Families of Finite String Rewriting Systems and Their Confluence -- Polite Theories Revisited -- Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference -- The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach -- On the Complexity of Model Expansion -- Labelled Unit Superposition Calculi for Instantiation-Based Reasoning -- Boosting Local Search Thanks to cdcl -- Interpolating Quantifier-Free Presburger Arithmetic -- Variable Compression in ProbLog -- Improving Resource-Unaware SAT Solvers -- Expansion Nets: Proof-Nets for Propositional Classical Logic -- Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting -- An Isabelle-Like Procedural Mode for HOL Light -- Bottom-Up Tree Automata with Term Constraints -- Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories -- PBINT, A Logic for Modelling Search Problems Involving Arithmetic -- Resolution for Stochastic Boolean Satisfiability -- Symbolic Automata Constraint Solving.
520 _aThis volume contains the research papers presented at the 17th International Conference on Logic for Programming, Arti?cial Intelligence, and Reasoning (LPAR-17), held in Yogyakarta, Indonesia, October 10–15, 2010, accompanied by the 8th International Workshop on the Implementation of Logic (IWIL-8, organized by Eugenia Ternovska, Stephan Schulz, and Geo? Sutcli?e) and the 5th International Workshop on Analytic Proof Systems (APS-5, organized by Matthias Baaz and Christian Fermuller ¨ ). The call for papers attracted 133 abstract submissions of which 105 ma- rialized into full submissions, each of which was assigned for reviewing to at least three Program Committee members; 41 papers were accepted after - tense discussions. Once more the EasyChair system provided an ideal platform for submission, reviewing, discussions, and collecting ?nal versions of accepted papers. The program included three invited talks by Krishnendu Chatterjee, Joseph Halpern, and Michael Maher, as well as an invited tutorial by Norbert Preining. They are documented by the corresponding papers and abstract, respectively, in these proceedings, which this year appear for the ?rst time in the ARCoSS subline of the Lecture Notes in Computer Science.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aSoftware Engineering.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aProgramming Techniques.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
700 1 _aVoronkov, Andrei.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642162411
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6397
856 4 0 _zLibro electrónico
_uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-16242-8
596 _a19
942 _cLIBRO_ELEC
999 _c203138
_d203138