Logic for Programming, Artificial Intelligence, and Reasoning 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Fermüller, Christian G. (Επιμελητής έκδοσης), Voronkov, Andrei (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Σειρά:Lecture Notes in Computer Science, 6397
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04918nam a22005895i 4500
001 978-3-642-16242-8
003 DE-He213
005 20151204142510.0
007 cr nn 008mamaa
008 101004s2010 gw | s |||| 0|eng d
020 |a 9783642162428  |9 978-3-642-16242-8 
024 7 |a 10.1007/978-3-642-16242-8  |2 doi 
040 |d GrThAP 
050 4 |a Q334-342 
050 4 |a TJ210.2-211.495 
072 7 |a UYQ  |2 bicssc 
072 7 |a TJFM1  |2 bicssc 
072 7 |a COM004000  |2 bisacsh 
082 0 4 |a 006.3  |2 23 
245 1 0 |a Logic for Programming, Artificial Intelligence, and Reasoning  |h [electronic resource] :  |b 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings /  |c edited by Christian G. Fermüller, Andrei Voronkov. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a XII, 656 p. 83 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6397 
505 0 |a The 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. 
650 0 |a Computer science. 
650 0 |a Computer programming. 
650 0 |a Software engineering. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Software Engineering. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Programming Languages, Compilers, Interpreters. 
700 1 |a Fermüller, Christian G.  |e editor. 
700 1 |a Voronkov, Andrei.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642162411 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6397 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-16242-8  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)