default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th IJCAR 2016: Coimbra, Portugal
- Nicola Olivetti, Ashish Tiwari
:
Automated Reasoning - 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings. Lecture Notes in Computer Science 9706, Springer 2016, ISBN 978-3-319-40228-4
Invited Talks
- Arnon Avron:
A Logical Framework for Developing and Mechanizing Set Theories. 3-8 - Sumit Gulwani:
Programming by Examples: Applications, Algorithms, and Ambiguity Resolution. 9-14 - André Platzer:
Logic & Proofs for Cyber-Physical Systems. 15-21
Satisfiability of Boolean Formulas
- Jasmin Christian Blanchette, Mathias Fleury, Christoph Weidenbach:
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality. 25-44 - Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Super-Blocked Clauses. 45-61
Satisfiability Modulo Theory
- Francesco Alberti, Silvio Ghilardi, Elena Pagani:
Counting Constraints in Flat Array Fragments. 65-81 - Kshitij Bansal, Andrew Reynolds, Clark W. Barrett, Cesare Tinelli:
A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT. 82-98 - Daniel Selsam, Leonardo de Moura:
Congruence Closure in Intensional Type Theory. 99-115 - Martin Bromberger, Christoph Weidenbach:
Fast Cube Tests for LIA Constraint Solving. 116-132 - Andrew Reynolds, Jasmin Christian Blanchette, Simon Cruanes, Cesare Tinelli:
Model Finding for Recursive Functions in SMT. 133-151 - Roberto Sebastiani:
Colors Make Theories Hard. 152-170
Rewriting
- Takahito Aoto, Kentaro Kikuchi:
Nominal Confluence Tool. 173-182 - Francisco Durán, Steven Eker, Santiago Escobar, Narciso Martí-Oliet, José Meseguer, Carolyn L. Talcott:
Built-in Variant Generation and Unification, and Their Applications in Maude 2.7. 183-192
Arithmetic Reasoning and Mechanizing Mathematics
- Ting Gan, Liyun Dai, Bican Xia, Naijun Zhan, Deepak Kapur, Mingshuai Chen:
Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF. 195-212 - Takuya Matsuzaki, Hidenao Iwane, Munehiro Kobayashi, Yiyang Zhan, Ryoya Fukasaku, Jumma Kudo, Hirokazu Anai, Noriko H. Arai:
Race Against the Teens - Benchmarking Mechanized Math on Pre-university Problems. 213-227 - Vu Xuan Tung, To Van Khanh, Mizuhito Ogawa:
raSAT: An SMT Solver for Polynomial Constraints. 228-237
First-Order Logic and Proof Theory
- David M. Cerna, Alexander Leitsch:
Schematic Cut Elimination and the Ordered Pigeonhole Principle. 241-256 - Hans de Nivelle:
Subsumption Algorithms for Three-Valued Geometric Resolution. 257-272 - Viorica Sofronie-Stokkermans:
On Interpolation and Symbol Elimination in Theory Extensions. 273-289
First-Order Theorem Proving
- Gabriel Ebner, Stefan Hetzl, Giselle Reis, Martin Riener, Simon Wolfsteiner, Sebastian Zivota:
System Description: GAPT 2.0. 293-301 - Jens Otten:
nanoCoP: A Non-clausal Connection Prover. 302-312 - Krystof Hoder, Giles Reger, Martin Suda, Andrei Voronkov:
Selecting the Selection. 313-329 - Stephan Schulz, Martin Möhrmann:
Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving. 330-345
Higher-Order Theorem Proving
- Michael Färber, Chad E. Brown:
Internal Guidance for Satallax. 349-361 - Max Wisniewski, Alexander Steen, Kim Kern, Christoph Benzmüller:
Effective Normalization Techniques for HOL. 362-370
Modal and Temporal Logics
- Joseph Boudou:
Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition. 373-388 - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments. 389-405 - Cláudia Nalon, Ullrich Hustadt, Clare Dixon:
: A Resolution-Based Prover for Multimodal K. 406-415 - Revantha Ramanayake:
Inducing Syntactic Cut-Elimination for Indexed Nested Sequents. 416-432
Non-classical Logics
- Diana Costa, Manuel A. Martins:
A Tableau System for Quasi-Hybrid Logic. 435-451 - Jeremy E. Dawson, James Brotherston, Rajeev Goré:
Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi. 452-468 - Simon Docherty, David J. Pym:
Intuitionistic Layered Graph Logic. 469-486 - Yoni Zohar, Anna Zamansky:
Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi. 487-495
Verification
- Benjamin Aminof, Sasha Rubin:
Model Checking Parameterised Multi-token Systems via the Composition Method. 499-515 - Konstantinos Athanasiou, Peizun Liu, Thomas Wahl:
Unbounded-Thread Program Verification using Thread-State Equations. 516-531 - Xincai Gu, Taolue Chen, Zhilin Wu:
A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints. 532-549 - Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl:
Lower Runtime Bounds for Integer Programs. 550-567 - Lars Hupel, Viktor Kuncak:
Translating Scala Programs to Isabelle/HOL - System Description. 568-577
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-03-04 20:53 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:
