default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th LPAR 2023: Manizales, Colombia
- Ruzica Piskac, Andrei Voronkov:
LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Manizales, Colombia, 4-9th June 2023. EPiC Series in Computing 94, EasyChair 2023 - Mauricio Ayala-Rincón, Thaynara Arielly de Lima, Andréia B. Avelar, André Luiz Galdino:
Formalization of Algebraic Theorems in PVS (Invited Talk). 1-10 - Haniel Barbosa, Chantal Keller, Andrew Reynolds, Arjun Viswanathan, Cesare Tinelli, Clark W. Barrett:
An Interactive SMT Tactic in Coq using Abductive Reasoning. 11-22 - Raven Beutner, Bernd Finkbeiner:
Model Checking Omega-Regular Hyperproperties with AutoHyperQ. 23-35 - Ahmed Bhayat
, Konstantin Korovin, Laura Kovács, Johannes Schoisswohl:
Refining Unification with Abstraction. 36-47 - Martin Bromberger, Simon Schwarz, Christoph Weidenbach:
Exploring Partial Models with SCL. 48-72 - Richard Bubel, Dilian Gurov, Reiner Hähnle, Marco Scaletta:
Trace-based Deductive Verification. 73-95 - Filip Bártek, Martin Suda:
How Much Should This Symbol Weigh? A GNN-Advised Clause Selection. 96-111 - Karel Chvalovský, Konstantin Korovin, Jelle Piepenbrock, Josef Urban:
Guiding an Instantiation Prover with Graph Neural Networks. 112-123 - Elazar Cohen, Yizhak Yisrael Elboher, Clark W. Barrett, Guy Katz:
Tighter Abstract Queries in Neural Network Verification. 124-143 - Luís Cruz-Filipe, Fabrizio Montesi, Robert R. Rasmussen:
Keep me out of the loop: a more flexible choreographic projection. 144-163 - Omar Ettarguy, Ahlame Begdouri, Salem Benferhat, Carole Delenne:
Syntactic computation of Fagin-Halpern conditioning in possibility theory. 164-180 - Bernd Finkbeiner, Julian Siber:
Counterfactuals Modulo Temporal Logics. 181-204 - Oskar Fiuk, Emanuel Kieronski:
An excursion to the border of decidability: between two- and three-variable logic. 205-223 - Thibault Gauthier, Chad E. Brown, Mikolas Janota, Josef Urban:
A Mathematical Benchmark for Inductive Theorem Provers. 224-237 - Thomas Hader, Daniela Kaufmann, Laura Kovács:
SMT Solving over Finite Field Arithmetic. 238-256 - Petra Hozzová, Jaroslav Bendík, Alexander Nutz, Yoav Rodeh:
Overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification. 257-269 - Mohimenul Kabir, Kuldeep S. Meel:
A Fast and Accurate ASP Counting Based Network Reliability Estimator. 270-287 - Yurii Kostyukov, Dmitry Mordvinov, Grigory Fedyukovich:
Collaborative Inference of Combined Invariants. 288-305 - Albert Oliveras, Enric Rodríguez-Carbonell, Rui Zhao:
Analyzing Multiple Conflicts in SAT: An Experimental Evaluation. 306-316 - Julian Parsert, Chad E. Brown, Mikolas Janota, Cezary Kaliszyk:
Experiments on Infinite Model Finding in SMT Solving. 317-328 - Alexander Pluska, Florian Zuleger:
Embedding Intuitionistic into Classical Logic. 329-349 - Rodrigo Raya, Jad Hamza, Viktor Kuncak:
On the Complexity of Convex and Reverse Convex Prequadratic Constraints. 350-368 - Alexander Steen, Geoff Sutcliffe, Pascal Fontaine, Jack McKeown:
Representation, Verification, and Visualization of Tarskian Interpretations for Typed First-order Logic. 369-385 - Bernardo Subercaseaux, Marijn Heule:
Toward Optimal Radio Colorings of Hypercubes via SAT-solving. 386-404 - Jan Tusil, Traian Serbanuta, Jan Obdrzálek:
Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties. 405-456 - Suwei Yang, Victor C. Liang, Kuldeep S. Meel:
Scalable Probabilistic Routes. 457-472 - Natalia Slusarz, Ekaterina Komendantskaya, Matthew L. Daggitt, Robert J. Stewart, Kathrin Stark:
Logic of Differentiable Logics: Towards a Uniform Semantics of DL. 473-493
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-02 20:31 CEST 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:
