default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th LPAR 2012: Mérida, Venezuela
- Nikolaj S. Bjørner, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 18th International Conference, LPAR-18, Mérida, Venezuela, March 11-15, 2012. Proceedings. Lecture Notes in Computer Science 7180, Springer 2012, ISBN 978-3-642-28716-9 - Elvira Albert, Puri Arenas, Samir Genaim
, Miguel Gómez-Zamalloa, Germán Puebla:
Automatic Inference of Resource Consumption Bounds. 1-11 - Aart Middeldorp:
Matrix Interpretations for Polynomial Derivational Complexity of Rewrite Systems. 12 - Boris Motik:
Parameterized Complexity and Fixed-Parameter Tractability of Description Logic Reasoning. 13-14 - Amir Aavani, Xiongnan (Newman) Wu, Shahab Tasharrofi, Eugenia Ternovska, David G. Mitchell:
Enfragmo: A System for Modelling and Solving Search Problems with Logic. 15-22 - Beniamino Accattoli, Delia Kesner:
The Permutative λ-Calculus. 23-36 - Jesse Alama, Daniel Kühlwein, Josef Urban:
Automated and Human Proofs in General Mathematics: An Initial Comparison. 37-45 - Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise, Natasha Sharygina:
Lazy Abstraction with Interpolants for Arrays. 46-61 - María Alpuente, Demis Ballis, Francisco Frechina, Daniel Romero:
Backward Trace Slicing for Conditional Rewrite Theories. 62-76 - Grigoris Antoniou, Thomas Eiter, Kewen Wang:
Forgetting for Defeasible Logic. 77-91 - David Aspinall, Ewen Denney, Christoph Lüth:
Querying Proofs. 92-106 - Franz Baader, Alexander Okhotin:
Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints. 107-121 - Nikola Benes, Jan Kretínský, Kim Guldstrand Larsen, Mikael H. Møller, Jirí Srba:
Dual-Priced Modal Transition Systems with Time Durations. 122-137 - Stefan Borgwardt, Barbara Morawska:
Finding Finite Herbrand Models. 138-152 - Lukas Bulwahn:
Smart Testing of Functional Programs in Isabelle. 153-167 - Peter E. Bulychev, Alexandre David, Kim Guldstrand Larsen, Axel Legay, Guangyuan Li, Danny Bøgsted Poulsen, Amélie Stainer:
Monitor-Based Statistical Model Checking for Weighted Metric Temporal Logic. 168-182 - José Luis Chacón, Ramón Pino Pérez:
Duality between Merging Operators and Social Contraction Operators. 183-196 - Arnaud Fietzke, Evgeny Kruglov, Christoph Weidenbach:
Automatic Generation of Invariants for Circular Derivations in SUP(LA). 197-211 - Han The Anh, Ari Saptawijaya, Luís Moniz Pereira:
Moral Reasoning under Uncertainty. 212-227 - Stefan Hetzl, Alexander Leitsch, Daniel Weller:
Towards Algorithmic Cut-Introduction. 228-242 - Hadi Katebi, Karem A. Sakallah, Igor L. Markov:
Conflict Anticipation in the Search for Graph Automorphisms. 243-257 - Dominik Klein, Nao Hirokawa:
Confluence of Non-Left-Linear TRSs via Relative Termination. 258-273 - Leonid Libkin, Domagoj Vrgoc:
Regular Expressions for Data Words. 274-288 - Stephan Merz, Hernán Vanzetto:
Automatic Verification of TLA + Proof Obligations with SMT Solvers. 289-303 - Andreas Morgenstern, Manuel Gesell, Klaus Schneider:
An Asymptotically Correct Finite Path Semantics for LTL. 304-319 - Friedrich Neurauter, Aart Middeldorp:
On the Domain and Dimension Hierarchy of Matrix Interpretations. 320-334 - Ezequiel Orbe, Carlos Areces, Gabriel G. Infante López:
iSat: Structure Visualization for SAT Problems. 335-342 - Martin Hofmann, Dulma Rodriguez:
Linear Constraints over Infinite Trees. 343-358 - Philipp Rümmer:
E-Matching with Free Variables. 359-374 - Gianluca Amato, Francesca Scozzari:
Random: R-Based Analyzer for Numerical Domains. 375-382 - William Snell, Dirk Pattinson, Florian Widmann:
Solving Graded/Probabilistic Modal Logic via Linear Inequalities (System Description). 383-390 - Martin Suda, Christoph Weidenbach:
Labelled Superposition for PLTL. 391-405 - Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Peter Baumgartner:
The TPTP Typed First-Order Form with Arithmetic. 406-419 - Sarah Winkler, Harald Zankl, Aart Middeldorp:
Ordinals and Knuth-Bendix Orders. 420-434 - Jens Knoop, Laura Kovács, Jakob Zwirchmayr:
r-TuBound: Loop Bounds for WCET Analysis (Tool Paper). 435-444
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:
