default search action
19th LPAR 2013: Stellenbosch, South Africa
- Kenneth L. McMillan, Aart Middeldorp, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings. Lecture Notes in Computer Science 8312, Springer 2013, ISBN 978-3-642-45220-8 - Luca Aceto, Dario Della Monica
, Anna Ingólfsdóttir, Angelo Montanari, Guido Sciavicco
An Algorithm for Enumerating Maximal Models of Horn Theories with an Application to Modal Logics. 1-17 - Elvira Albert, Samir Genaim
May-Happen-in-Parallel Analysis for Priority-Based Scheduling. 18-34 - Alessandro Artale, Roman Kontchakov
The Complexity of Clausal Fragments of LTL. 35-52 - David Aspinall, Ewen Denney, Christoph Lüth:
A Semantic Basis for Proof Queries and Transformations. 53-70 - Pablo Barceló, Gaëlle Fontaine, Anthony Widjaja Lin:
Expressive Path Queries on Graphs with Data. 71-85 - Peter Baumgartner, Joshua Bax:
Proving Infinite Satisfiability. 86-95 - Anton Belov, António Morgado
SAT-Based Preprocessing for MaxSAT. 96-111 - Belaid Benhamou:
Dynamic and Static Symmetry Breaking in Answer Set Programming. 112-126 - Christoph Benzmüller
HOL Based First-Order Modal Logic Provers. 127-136 - Josh Berdine, Nikolaj S. Bjørner, Samin Ishtiaq, Jael E. Kriener, Christoph M. Wintersteiger
Resourceful Reachability as HORN-LA. 137-146 - Patrick Blackburn
A Seligman-Style Tableau System. 147-163 - Frantisek Blahoudek
Comparison of LTL to Deterministic Rabin Automata Translators. 164-172 - Régis Blanc, Ashutosh Gupta, Laura Kovács
Tree Interpolation in Vampire. 173-181 - Mélanie Boudard, Olivier Hermant:
Polarizing Double-Negation Translations. 182-197 - Filipe Casal
Revisiting the Equivalence of Shininess and Politeness. 198-212 - Giovanni Casini
Towards Rational Closure for Fuzzy Logic: The Case of Propositional Gödel Logic. 213-227 - Krishnendu Chatterjee, Vojtech Forejt, Dominik Wojtczak
Multi-objective Discounted Reward Verification in Graphs and MDPs. 228-242 - Luís Cruz-Filipe
Description Logics, Rules and Multi-context Systems. 243-257 - Ugo Dal Lago
Complexity Analysis in Presence of Control Operators and Higher-Order Functions. 258-273 - David Delahaye, Damien Doligez, Frédéric Gilbert, Pierre Halmagrand, Olivier Hermant
Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo. 274-290 - Uwe Egly, Florian Lonsing
Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving. 291-308 - Tim French
Verifying Temporal Properties in Real Models. 309-323 - Gudmund Grov, Aleks Kissinger
A Graphical Language for Proof Strategies. 324-339 - Tom Gundersen, Willem Heijltjes
A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus. 340-354 - David Harel, Amir Kantor, Guy Katz:
Relaxing Synchronization Constraints in Behavioral Programs. 355-372 - Bernhard Heinemann:
Characterizing Subset Spaces as Bi-topological Structures. 373-388 - Jónathan Heras
Proof-Pattern Recognition and Lemma Discovery in ACL2. 389-406 - Lisa Allali, Olivier Hermant
Semantic A-translations and Super-Consistency Entail Classical Cut Elimination. 407-422 - Marijn Heule, Armin Biere
Blocked Clause Decomposition. 423-438 - Alexey Ignatiev
Maximal Falsifiability - Definitions, Algorithms, and Applications. 439-456 - Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv:
Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning. 457-472 - Mikolás Janota
On QBF Proofs and Preprocessing. 473-489 - Chuan Jiang, Ting Zhang:
Partial Backtracking in CDCL Solvers. 490-502 - Cezary Kaliszyk
Lemma Mining over HOL Light. 503-517 - Guy Katz:
On Module-Based Abstraction and Repair of Behavioral Programs. 518-535 - Szymon Klarman, Thomas Meyer
Prediction and Explanation over DL-Lite Data Streams. 536-551 - Patrick Koopmann
Forgetting Concept and Role Symbols in $\mathcal{ALCH}$ -Ontologies. 552-567 - Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä:
Simulating Parity Reasoning. 568-583 - Petr Cintula
Herbrand Theorems for Substructural Logics. 584-600 - Fabio Mogavero
On Promptness in Parity Games. 601-618 - Sebastian Mödersheim
Defining Privacy Is Supposed to Be Easy. 619-635 - Riku Nortje, Katarina Britz, Thomas Meyer
Reachability Modules for the Description Logic $\mathcal{SRIQ}$. 636-652 - Annabelle McIver
An Event Structure Model for Probabilistic Concurrent Kleene Algebra. 653-667 - Etienne Renault
Three SCC-Based Emptiness Checks for Generalized Büchi Automata. 668-682 - Simone Fulvio Rollini, Leonardo Alt, Grigory Fedyukovich
PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification. 683-693 - Ari Saptawijaya
Incremental Tabling for Query-Driven Propagation of Logic Program Updates. 694-709 - Gabriel Scherer, Jan Hoffmann:
Tracking Data-Flow with Open Closure Types. 710-726 - Maximilian Schlund, Michal Terepeta, Michael Luttenberger:
Putting Newton into Practice: A Solver for Polynomial Equations over Semirings. 727-734 - Stephan Schulz:
System Description: E 1.8. 735-743 - Syeda Hira Taqdees, Osman Hasan
Formalization of Laplace Transform Using the Multivariable Calculus Theory of HOL-Light. 744-758 - Calin-Rares Turliuc, Nataly Maimari, Alessandra Russo
On Minimality and Integrity Constraints in Probabilistic Abduction. 759-775 - Dominik Dietrich, Iain Whiteside, David Aspinall:
Polar: A Framework for Proof Refactoring. 776-791
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-03 23:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: