17. LPAR 2010: Yogyakarta, Indonesia

• Krishnendu Chatterjee, Laurent Doyen:
  The Complexity of Partial-Observation Parity Games. 1-14
  
• Joseph Y. Halpern:
  Awareness in Games, Awareness in Logic. 15
  
• Michael J. Maher:
  Human and Unhuman Commonsense Reasoning. 16-29
  
• Norbert Preining:
  Gödel Logics - A Survey. 30-51
  
• Régis Alenda, Nicola Olivetti:
  Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces. 52-66
  
• Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte:
  Extended Computation Tree Logic. 67-81
  
• Franz Baader, Marcel Lippmann, Hongkai Liu:
  Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics. 82-96
  
• Franz Baader, Barbara Morawska:
  SAT Encoding of Unification in EL. 97-111
  
• Mutsunori Banbara, Haruki Matsunaka, Naoyuki Tamura, Katsumi Inoue:
  Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers. 112-126
  
• Jasmin Christian Blanchette, Koen Claessen:
  Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models. 127-141
  
• Guillaume Bonfante, Georg Moser:
  Characterising Space Complexity Classes via Knuth-Bendix Orders. 142-156
  
• Taus Brock-Nannestad, Carsten Schürmann:
  Focused Natural Deduction. 157-171
  
• Kai Brünnler:
  How to Universally Close the Existential Rule. 172-186
  
• Witold Charatonik, Piotr Witkowski:
  On the Complexity of the Bernays-Schönfinkel Class with Datalog. 187-201
  
• Kaustuv Chaudhuri:
  Magically Constraining the Inverse Method Using Dynamic Polarity Assignment. 202-216
  
• Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp:
  Lazy Abstraction for Size-Change Termination. 217-232
  
• Jean-François Condotta, Souhila Kaci, Pierre Marquis, Nicolas Schwind:
  A Syntactical Approach to Qualitative Constraint Networks Merging. 233-247
  
• Claire David, Leonid Libkin, Tony Tan:
  On the Satisfiability of Two-Variable Logic over Data Words. 248-262
  
• Jeremy E. Dawson, Rajeev Goré:
  Generic Methods for Formalising Sequent Calculi Applied to Provability Logic. 263-277
  
• Yuxin Deng, Rob J. van Glabbeek:
  Characterising Probabilistic Processes Logically - (Extended Abstract). 278-293
  
• Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
  fCube: An Efficient Prover for Intuitionistic Propositional Logic. 294-301
  
• Arnaud Fietzke, Holger Hermanns, Christoph Weidenbach:
  Superposition-Based Analysis of First-Order Probabilistic Timed Automata. 302-316
  
• Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
  A Nonmonotonic Extension of KLM Preferential Logic P. 317-332
  
• Benjamin Grégoire, Jorge Luis Sacchini:
  On Strong Normalization of the Calculus of Constructions with Type-Based Termination. 333-347
  
• Thomas A. Henzinger, Thibaud Hottelier, Laura Kovács, Andrey Rybalchenko:
  Aligators for Arrays (Tool Paper). 348-356
  
• Marijn Heule, Matti Järvisalo, Armin Biere:
  Clause Elimination Procedures for CNF Formulas. 357-371
  
• Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
  Partitioning SAT Instances for Distributed Solving. 372-386
  
• Jean-Pierre Jouannaud, Benjamin Monate:
  Infinite Families of Finite String Rewriting Systems and Their Confluence. 387-401
  
• Dejan Jovanovic, Clark Barrett:
  Polite Theories Revisited. 402-416
  
• Mark Kaminski, Gert Smolka:
  Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference. 417-431
  
• Pavel Klinov, Bijan Parsia, David Picado-Muiño:
  The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach. 432-446
  
• Antonina Kolokolova, Yongmei Liu, David G. Mitchell, Eugenia Ternovska:
  On the Complexity of Model Expansion. 447-458
  
• Konstantin Korovin, Christoph Sticksel:
  Labelled Unit Superposition Calculi for Instantiation-Based Reasoning. 459-473
  
• Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
  Boosting Local Search Thanks to cdcl. 474-488
  
• Daniel Kroening, Jérôme Leroux, Philipp Rümmer:
  Interpolating Quantifier-Free Presburger Arithmetic. 489-503
  
• Theofrastos Mantadelis, Gerda Janssens:
  Variable Compression in ProbLog. 504-518
  
• Steffen Hölldobler, Norbert Manthey, Ari Saptawijaya:
  Improving Resource-Unaware SAT Solvers. 519-534
  
• Richard McKinley:
  Expansion Nets: Proof-Nets for Propositional Classical Logic. 535-549
  
• Friedrich Neurauter, Harald Zankl, Aart Middeldorp:
  Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting. 550-564
  
• Petros Papapanagiotou, Jacques D. Fleuriot:
  An Isabelle-Like Procedural Mode for HOL Light. 565-580
  
• Andreas Reuß, Helmut Seidl:
  Bottom-Up Tree Automata with Term Constraints. 581-593
  
• Camilo Rocha, José Meseguer:
  Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories. 594-609
  
• Shahab Tasharrofi, Eugenia Ternovska:
  PBINT, A Logic for Modelling Search Problems Involving Arithmetic. 610-624
  
• Tino Teige, Martin Fränzle:
  Resolution for Stochastic Boolean Satisfiability. 625-639
  
• Margus Veanes, Nikolaj Bjørner, Leonardo Mendonça de Moura:
  Symbolic Automata Constraint Solving. 640-654
  

Last update Fri May 25 08:25:35 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page