- 2010
- Régis Alenda, Nicola Olivetti:
Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces. LPAR (Yogyakarta) 2010: 52-66 - Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
Boosting Local Search Thanks to cdcl. LPAR (Yogyakarta) 2010: 474-488 - Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte:
Extended Computation Tree Logic. LPAR (Yogyakarta) 2010: 67-81 - Franz Baader, Marcel Lippmann, Hongkai Liu:
Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics. LPAR (Yogyakarta) 2010: 82-96 - Franz Baader, Barbara Morawska
:
SAT Encoding of Unification in EL. LPAR (Yogyakarta) 2010: 97-111 - Mutsunori Banbara
, Haruki Matsunaka, Naoyuki Tamura
, Katsumi Inoue
:
Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers. LPAR (Yogyakarta) 2010: 112-126 - Jasmin Christian Blanchette, Koen Claessen:
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models. LPAR (Yogyakarta) 2010: 127-141 - Guillaume Bonfante, Georg Moser:
Characterising Space Complexity Classes via Knuth-Bendix Orders. LPAR (Yogyakarta) 2010: 142-156 - Taus Brock-Nannestad, Carsten Schürmann:
Focused Natural Deduction. LPAR (Yogyakarta) 2010: 157-171 - Kai Brünnler:
How to Universally Close the Existential Rule. LPAR (Yogyakarta) 2010: 172-186 - Witold Charatonik, Piotr Witkowski
:
On the Complexity of the Bernays-Schönfinkel Class with Datalog. LPAR (Yogyakarta) 2010: 187-201 - Krishnendu Chatterjee, Laurent Doyen:
The Complexity of Partial-Observation Parity Games. LPAR (Yogyakarta) 2010: 1-14 - Kaustuv Chaudhuri:
Magically Constraining the Inverse Method Using Dynamic Polarity Assignment. LPAR (Yogyakarta) 2010: 202-216 - Michael Codish
, Carsten Fuhs, Jürgen Giesl
, Peter Schneider-Kamp
:
Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) 2010: 217-232 - Jean-François Condotta, Souhila Kaci, Pierre Marquis
, Nicolas Schwind
:
A Syntactical Approach to Qualitative Constraint Networks Merging. LPAR (Yogyakarta) 2010: 233-247 - Claire David, Leonid Libkin
, Tony Tan:
On the Satisfiability of Two-Variable Logic over Data Words. LPAR (Yogyakarta) 2010: 248-262 - Jeremy E. Dawson, Rajeev Goré:
Generic Methods for Formalising Sequent Calculi Applied to Provability Logic. LPAR (Yogyakarta) 2010: 263-277 - Yuxin Deng
, Rob J. van Glabbeek:
Characterising Probabilistic Processes Logically - (Extended Abstract). LPAR (Yogyakarta) 2010: 278-293 - Mauro Ferrari
, Camillo Fiorentini
, Guido Fiorino:
fCube: An Efficient Prover for Intuitionistic Propositional Logic. LPAR (Yogyakarta) 2010: 294-301 - Arnaud Fietzke, Holger Hermanns, Christoph Weidenbach:
Superposition-Based Analysis of First-Order Probabilistic Timed Automata. LPAR (Yogyakarta) 2010: 302-316 - Laura Giordano
, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
A Nonmonotonic Extension of KLM Preferential Logic P. LPAR (Yogyakarta) 2010: 317-332 - Benjamin Grégoire, Jorge Luis Sacchini:
On Strong Normalization of the Calculus of Constructions with Type-Based Termination. LPAR (Yogyakarta) 2010: 333-347 - Joseph Y. Halpern:
Awareness in Games, Awareness in Logic. LPAR (Yogyakarta) 2010: 15 - Thomas A. Henzinger, Thibaud Hottelier, Laura Kovács
, Andrey Rybalchenko:
Aligators for Arrays (Tool Paper). LPAR (Yogyakarta) 2010: 348-356 - Marijn Heule, Matti Järvisalo
, Armin Biere
:
Clause Elimination Procedures for CNF Formulas. LPAR (Yogyakarta) 2010: 357-371 - Steffen Hölldobler, Norbert Manthey, Ari Saptawijaya:
Improving Resource-Unaware SAT Solvers. LPAR (Yogyakarta) 2010: 519-534 - Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Partitioning SAT Instances for Distributed Solving. LPAR (Yogyakarta) 2010: 372-386 - Jean-Pierre Jouannaud, Benjamin Monate:
Infinite Families of Finite String Rewriting Systems and Their Confluence. LPAR (Yogyakarta) 2010: 387-401 - Dejan Jovanovic, Clark W. Barrett
:
Polite Theories Revisited. LPAR (Yogyakarta) 2010: 402-416 - Mark Kaminski, Gert Smolka:
Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference. LPAR (Yogyakarta) 2010: 417-431