Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar17. LPAR 2010: Yogyakarta, Indonesia
Christian G. Fermüller, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings. Lecture Notes in Computer Science 6397, Springer 2010, ISBN 978-3-642-16241-1- 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 - 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 - 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 - 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 - 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 - Steffen Hölldobler, Norbert Manthey, Ari Saptawijaya:
Improving Resource-Unaware SAT Solvers. 519-534 - Friedrich Neurauter, Harald Zankl, Aart Middeldorp:
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting. 550-564 - 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 - Margus Veanes, Nikolaj Bjørner, Leonardo Mendonça de Moura:
Symbolic Automata Constraint Solving. 640-654
maintained by 
at 
at 
last updated on 2018-05-25 22:48 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint