default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th LPAR 2007: Yerevan, Armenia
- Nachum Dershowitz, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings. Lecture Notes in Computer Science 4790, Springer 2007, ISBN 978-3-540-75558-6 - Johann A. Makowsky:
From Hilbert's Program to a Logic Toolbox. 1 - Marko Samer, Helmut Veith:
On the Notion of Vacuous Truth. 2-14 - Richard J. Waldinger:
Whatever Happened to Deductive Question Answering? 15-16 - Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sagiv:
Decidable Fragments of Many-Sorted Logic. 17-31 - Pietro Abate, Rajeev Goré, Florian Widmann:
One-Pass Tableaux for Computation Tree Logic. 32-46 - Behzad Akbarpour, Lawrence C. Paulson:
Extending a Resolution Prover for Inequalities on Elementary Functions. 47-61 - Roland Axelsson, Martin Lange:
Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. 62-76 - Matthias Baaz, Agata Ciabattoni
, Christian G. Fermüller:
Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. 77-91 - David Baelde, Dale Miller:
Least and Greatest Fixed Points in Linear Logic. 92-106 - Leopoldo E. Bertossi, Loreto Bravo:
The Semantics of Consistency and Trust in Peer Data Exchange Systems. 107-122 - Marc Bezem, Tore Langholm, Michal Walicki:
Completeness and Decidability in Sequence Logic. 123-137 - Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
HORPO with Computability Closure: A Reconstruction. 138-150 - Richard Bonichon, David Delahaye, Damien Doligez:
Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs. 151-165 - Sebastian Brandt:
Matching in Hybrid Terminologies. 166-180 - Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch:
Verifying Cryptographic Protocols with Subterms Constraints. 181-195 - Véronique Cortier, Stéphanie Delaune:
Deciding Knowledge in Security Protocols for Monoidal Equational Theories. 196-210 - Zaynah Dargaye, Xavier Leroy:
Mechanized Verification of CPS Transformations. 211-225 - Francien Dechesne, Mohammad Reza Mousavi, Simona Orzan:
Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap. 226-241 - Stéphanie Delaune, Hai Lin, Christopher Lynch:
Protocol Verification Via Rigid/Flexible Resolution. 242-256 - Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
Preferential Description Logics. 257-272 - Philippe de Groote, Sarah Maarek, Ryo Yoshinaka:
On Two Extensions of Abstract Categorial Grammars. 273-287 - Éric Jaeger, Catherine Dubois:
Why Would You Trust B ? 288-302 - Yevgeny Kazakov, Ulrike Sattler, Evgeny Zolin:
How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited. 303-317 - Emanuel Kieronski, Lidia Tendera:
On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards. 318-332 - Adila Krisnadhi, Carsten Lutz:
Data Complexity in the EL Family of Description Logics. 333-347 - Michel Ludwig, Uwe Waldmann:
An Extension of the Knuth-Bendix Ordering with LPO-Like Properties. 348-362 - Roberto Maieli:
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic. 363-377 - Maarten Mariën, Johan Wittocx, Marc Denecker:
Integrating Inductive Definitions in SAT. 378-392 - Damiano Mazza, Michele Pagani:
The Separation Theorem for Differential Interaction Nets. 393-407 - Maja Milicic:
Complexity of Planning in Action Formalisms Based on Description Logics. 408-422 - David G. Mitchell, Faraz Hach, Raheleh Mohebali:
Faster Phylogenetic Inference with MXG. 423-437 - Alessandro Ferrante, Aniello Murano, Mimmo Parente:
Enriched µ-Calculus Pushdown Module Checking. 438-453 - Luís Moniz Pereira, Alexandre Miguel Pinto:
Approved Models for Normal Logic Programs. 454-468 - Gabriele Pulcini:
Permutative Additives and Exponentials. 469-483 - Marko Samer, Stefan Szeider:
Algorithms for Propositional Model Counting. 484-498 - Luigi Santocanale, Yde Venema:
Completeness for Flat Modal Fixpoint Logics. 499-513 - Mantas Simkus, Thomas Eiter:
\mathbbFDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols. 514-530 - Stéphane Demri, Alexander Rabinovich:
The Complexity of Temporal Logic with Until and Since over Ordinals. 531-545 - Josef Urban, Geoff Sutcliffe:
ATP Cross-Verification of the Mizar MPTP Challenge Problems. 546-560
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 2024-10-31 20:21 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:
