, ? equisatisfiability of sort encodings for first-order logic, by Popescu and myself, vol.17
, ? abstract soundness and completeness results for firstorder logics using coinductive methods, by Popescu, Traytel, and myself, pp.19-21
, ? soundness and refutational completeness of first-order unordered resolution, vol.87, p.86
, ? soundness and refutational completeness of a generalization of the superposition calculus
, ? soundness and completeness of resolution-based prime implicate generation, by Peltier, vol.77
, ? metatheoretical results about a paraconsistent propositional logic, vol.90
, ? soundness of a small-kernel first-order prover with equality described in Harrison's textbook [41], by Jensen
, ? correctness of an optimized tool chain for checking SAT solver certificates
, ? various metatheoretical results about a wide range of proof systems for classical propositional logic (sequent calculus, natural deduction, Hilbert systems, and resolution)
, ? extensions of Berghofer's formalization [9] of a firstorder natural deduction calculus, by From, vol.34
, ? soundness of a substitutionless first-order proof system, vol.36
, ? soundness and completeness of an epistemic logic with countably many agents, by From, vol.35
, ? modernization of Ridge and Margetson's formalization [82, 83] of a sequent calculus for a term-free first-order logic, vol.100
Predicting Learnt Clauses Quality in Modern SAT Solvers, IJCAI 2009, Craig Boutilier (Ed.). ijcai.org, pp.399-404, 2009. ,
Term Rewriting and All That, 1998. ,
Resolution Theorem Proving, Handbook of Automated Reasoning, pp.19-99, 2001. ,
Locales: A Module System for Mathematical Theories, J. Autom. Reasoning, vol.52, pp.123-153, 2014. ,
Auto-validation d'un système de preuves avec familles inductives, 1999. ,
A Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms, LNCS, vol.10395, pp.432-453, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01592186
Formalization of the Embedding Path Order for Lambda-Free Higher-Order Terms. Archive of Formal Proofs, 2018. ,
Superposition for Lambda-Free Higher-Order Logic, IJCAR 2018, Didier Galmiche, vol.10900, pp.28-46, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01904595
First-Order Logic According to Fitting. Archive of Formal Proofs, 2007. ,
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic, René Thiemann, and Dmitriy Traytel, vol.10483, pp.3-21, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01592196
CaDiCaL, Lingeling, Plingeling, Treengeling, YalSAT Entering the SAT Competition, SAT Competition 2017: Solver and Benchmark Descriptions, pp.14-15, 2017. ,
AVATAR Modulo Theories, GCAI 2016, vol.41, pp.39-52, 2016. ,
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality, J. Autom. Reasoning, vol.61, pp.333-366, 2018. ,
Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL, LIPIcs, vol.84, pp.1-11, 2017. ,
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality, IJCAR 2016, vol.9706, pp.25-44, 2016. ,
Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder, LNCS, vol.6172, pp.131-146, 2010. ,
Mechanizing the Metatheory of Sledgehammer, LNCS, vol.8152, pp.245-260, 2013. ,
Sound and Complete Sort Encodings for First-Order Logic. Archive of Formal Proofs, 2013. ,
, Abstract Completeness. Archive of Formal Proofs, 2017.
, , 2017.
Soundness and Completeness Proofs by, Coinductive Methods. J. Autom. Reasoning, vol.58, pp.149-179, 2017. ,
A Lambda-Free Higher-Order Recursive Path Order, LNCS, vol.10203, pp.461-479, 2017. ,
CoLoR: A Coq Library on Well-founded Rewrite Relations and Its Application to the Automated Verification of Termination Certificates, Math. Struct. Comput. Sci, vol.21, pp.827-859, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00543157
, René Thiemann, and Akihisa Yamada. 2017. Analyzing Program Termination and Complexity Automatically with AProVE, vol.10395, pp.454-471
The New Quickcheck for Isabelle: Random, Exhaustive and Symbolic Testing under One Roof, LNCS, vol.7679, pp.92-108, 2012. ,
Imperative Functional Programming with Isabelle/HOL, TPHOLs, 2008. ,
, LNCS, vol.5170, pp.134-149
Automated Certified Proofs with CiME3, LIPIcs, vol.10, pp.21-30, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00777669
Efficient Certified RAT Verification, LNCS, vol.10395, pp.220-236, 2017. ,
A Self-Verifying Theorem Prover, 2009. ,
Proving Termination with Multiset Orderings, Commun. ACM, vol.22, pp.465-476, 1979. ,
An Extensible SAT-Solver, SAT 2003, 2003. ,
, LNCS, vol.2919, pp.502-518
Labelled Splitting, Ann. Math. Artif. Intell, vol.55, pp.3-34, 2009. ,
A Verified SAT Solver with Watched Literals using Imperative HOL, CPP 2018, pp.158-171, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01904647
First-Order Logic According to Berghofer. Isabelle Formalization of Logic, 2017. ,
Epistemic Logic. Archive of Formal Proofs, 2018. ,
Substitutionless First-Order Logic: A Formal Soundness Proof, 2018. ,
From LCF to HOL: A Short History, Proof, Language, and Interaction, 2000. ,
Code Generation via Higher-Order Rewrite Systems, FLOPS 2010, vol.6009, pp.103-117, 2010. ,
Formalizing Basic First Order Model Theory, LNCS, vol.1479, pp.153-170, 1998. ,
Towards Self-Verification of HOL Light, LNCS, vol.4130, pp.177-191, 2006. ,
Handbook of Practical Logic and Automated Reasoning, 2009. ,
Bridging the Gap between Easy Generation and Efficient Verification of Unsatisfiability Proofs, Softw. Test. Verif. Reliab, vol.24, pp.593-607, 2014. ,
Equations and Rewrite Rules: A Survey, Formal Language Theory: Perspectives and Open Problems, pp.349-405, 1980. ,
Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL, LNCS, vol.8307, pp.131-146, 2013. ,
First-Order Proof Tactics in Higher-Order Logic Theorem Provers, Design and Application of Strategies/Tactics in Higher Order Logics, pp.56-68, 2003. ,
Inprocessing Rules, LNCS, vol.7364, pp.355-370, 2012. ,
Programming and Verifying a Declarative First-Order Prover in Isabelle/HOL, AI Commun, vol.31, pp.281-299, 2018. ,
First-Order Logic According to Harrison. Archive of Formal Proofs, 2017. ,
Recursive Definitions of Monadic Functions, EPTCS, vol.43, pp.1-13, 2010. ,
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL, LNCS, vol.4720, pp.1-27, 2007. ,
Self-Formalisation of Higher-Order Logic: Semantics, Soundness, and a Verified Implementation, J. Autom. Reasoning, vol.56, pp.221-259, 2016. ,
CakeML: A Verified Implementation of ML, pp.179-192, 2014. ,
Automatic Data Refinement, ITP 2013, vol.7998, pp.84-99, 2013. ,
Refinement to Imperative/HOL, LNCS, vol.9236, pp.253-269, 2015. ,
Efficient Verified (UN)SAT Certificate Checking, LNCS, vol.10395, pp.237-254, 2017. ,
The GRAT Tool Chain-Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees, LNCS, vol.10491, pp.457-463, 2017. ,
Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates, LNCS, vol.5584, pp.453-466, 2009. ,
A Framework for Certified Boolean Branch-and-Bound Optimization, J. Autom. Reasoning, vol.46, pp.81-102, 2011. ,
Formalizing and Implementing a Reflexive Tactic for Automated Deduction in Coq, Ph.D. Dissertation, 2011. ,
URL : https://hal.archives-ouvertes.fr/tel-00713668
Formal Verification of Modern SAT Solvers. Archive of Formal Proofs, 2008. ,
Formal Verification of a Modern SAT Solver by Shallow Embedding into Isabelle/HOL, Theor. Comput. Sci, vol.411, pp.4333-4356, 2010. ,
Formalization of Abstract State Transition Systems for SAT, Log. Meth. Comput. Sci, vol.7, p.3, 2011. ,
An Incremental Simplex Algorithm with Unsatisfiable Core Generation. Archive of Formal Proofs, 2018. ,
Proof Systems for Propositional Logic. Archive of Formal Proofs, 2017. ,
Formalized Proof Systems for Propositional Logic, TYPES 2017, vol.104, pp.1-6, 2018. ,
Chaff: Engineering an Efficient SAT Solver, DAC, pp.530-535, 2001. ,
A Verified Runtime for a Verified Theorem Prover, LNCS, vol.6898, pp.265-280, 2011. ,
The Reflective Milawa Theorem Prover Is Sound (Down to the Machine Code That Runs It), 2014. ,
, LNCS, vol.8558, pp.421-436
Solving SAT and SAT Modulo Theories: From an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T ), J. ACM, vol.53, issue.6, pp.937-977, 2006. ,
Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs, LNCS, vol.7148, pp.24-38, 2012. ,
Essential Incompleteness of Arithmetic Verified by Coq, LNCS, vol.3603, pp.245-260, 2005. ,
versat: A Verified Modern SAT Solver, LNCS, vol.7148, pp.363-378, 2012. ,
Experience Developing and Deploying Concurrency Analysis at Facebook, SAS 2018, Andreas Podelski, vol.11002, pp.56-70, 2018. ,
Gödel's Incompleteness Theorems. Archive of Formal Proofs, 2013. ,
A Mechanised Proof of Gödel's Incompleteness Theorems using Nominal Isabelle, J. Autom. Reasoning, vol.55, pp.1-37, 2015. ,
Three Years of Experience with Sledgehammer, a Practical Link Between Automatic and Interactive Theorem Provers, EPiC Series in Computing, vol.2, pp.1-11, 2012. ,
Propositional Resolution and Prime Implicates Generation. Archive of Formal Proofs, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01364005
A Variant of the Superposition Calculus, Archive of Formal Proofs, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01383903
Constructive Completeness of Intuitionistic Predicate Logic: A Formalisation in Type Theory. Licentiate Thesis. Chalmers tekniska högskola and Göteborgs universitet, 1996. ,
Lambda, the Ultimate TA: Using a Proof Assistant to Teach Programming Language Foundations, pp.121-122, 2009. ,
Playing with AVATAR, 2015. ,
, LNCS, vol.9195, pp.399-415
A Mechanically Verified, Efficient, Sound and Complete Theorem Prover For First Order Logic. Archive of Formal Proofs, 2004. ,
A Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic, LNCS, vol.3603, pp.294-309, 2005. ,
, Handbook of Automated Reasoning, Vols. I and II, 2001.
SmallCheck and Lazy SmallCheck: Automatic Exhaustive Testing for Small Values, pp.37-48, 2008. ,
The Resolution Calculus for First-Order Logic, Archive of Formal Proofs, 2016. ,
Formalization of the Resolution Calculus for First-Order Logic, J. Autom. Reasoning, vol.61, pp.455-484, 2018. ,
A Verified Prover Based on Ordered Resolution, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01937141
Formalizing Bachmair and Ganzinger's Ordered Resolution Prover, IJCAR 2018, Didier Galmiche, vol.10900, pp.89-107, 2018. ,
, Paraconsistency. Archive of Formal Proofs, 2016.
E-a Brainiac Theorem Prover, AI Commun, vol.15, pp.111-126, 2002. ,
Fingerprint Indexing for Paramodulation and Rewriting, LNCS, vol.7364, pp.477-483, 2012. ,
, Metamathematics, Machines, and Gödel's Proof, vol.38, 1994.
The Mechanical Verification of a DPLL-Based Satisfiability Solver, Electr. Notes Theor. Comput. Sci, vol.269, pp.3-17, 2011. ,
Extending SAT Solvers to Cryptographic Problems, SAT 2009, Oliver Kullmann, vol.5584, pp.244-257, 2009. ,
Formalization of Incremental Simplex Algorithm by Stepwise Refinement, LNCS, vol.7436, pp.434-449, 2012. ,
First-Order Terms. Archive of Formal Proofs, 2018. ,
Certification of Termination Proofs using CeTA, LNCS, vol.5674, pp.452-468, 2009. ,
Formalizing a Paraconsistent Logic in the Isabelle Proof Assistant. T. Large-Scale Data-and Knowledge-Centered Systems, vol.34, pp.92-122, 2017. ,
Simple Prover. Isabelle Formalization of Logic, 2018. ,
AVATAR: The Architecture for First-Order Theorem Provers, LNCS, vol.8559, pp.696-710, 2014. ,
Extending a Brainiac Prover to Lambda-Free Higher-Order Logic, 2018. ,
Automated Reasoning Building Blocks, Correct System Design: Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, vol.9360, pp.172-188, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01239428
Isabelle/Isar-a Generic Framework for Human-Readable Proof Documents, From Insight to Proof: Festschrift in Honour of Andrzej Trybulec, vol.10, 2007. ,
DRAT-trim: Efficient Checking and Trimming using Expressive Clausal Proofs, LNCS, vol.8561, pp.422-429, 2014. ,
Termination, Term Rewriting Systems, Marc Bezem, vol.55, pp.181-259, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-01402041