The following pages link to Nicolas Peltier (Q167063):
Displaying 40 items.
- Instantiation of SMT Problems Modulo Integers (Q3582696) (← links)
- Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps (Q3612651) (← links)
- A term-graph clausal logic: completeness and incompleteness results ★ (Q3643364) (← links)
- A Schemata Calculus for Propositional Logic (Q3648719) (← links)
- A new method for automated finite model building exploiting failures and symmetries (Q4209295) (← links)
- Pruning the search space and extracting more models in tableaux (Q4237680) (← links)
- (Q4250054) (← links)
- (Q4349580) (← links)
- (Q4430633) (← links)
- (Q4530458) (← links)
- (Q4531862) (← links)
- (Q4539642) (← links)
- Prime Implicate Generation in Equational Logic (Q4600725) (← links)
- Simplifying and generalizing formulae in tableaux. Pruning the search space and building models (Q4610336) (← links)
- Building Infinite Models for Equational Clause Sets: Constructing Non-Ambiguous Formulae (Q4795877) (← links)
- A Resolution-based Model Building Algorithm for a Fragment of OCC1N = (Q4916224) (← links)
- Completeness and Decidability Results for First-Order Clauses with Indices (Q4928428) (← links)
- The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates (Q5121270) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5187867) (← links)
- A method for building models automatically. Experiments with an extension of OTTER (Q5210763) (← links)
- Partial matching for analogy discovery in proofs and counter-examples (Q5234724) (← links)
- Building proofs or counterexamples by analogy in a resolution framework (Q5235252) (← links)
- (Q5294172) (← links)
- Logics in Artificial Intelligence (Q5394151) (← links)
- Non Strict Confluent Rewrite Systems for Data-Structures with Pointers (Q5432338) (← links)
- A Bottom-Up Approach to Clausal Tableaux (Q5434490) (← links)
- Tractable and intractable classes of propositional schemata (Q5498869) (← links)
- Automated Model Building: From Finite to Infinite Models (Q5505496) (← links)
- A Resolution Calculus for Shortening Proofs (Q5697719) (← links)
- Analogy in Automated Deduction: A Survey (Q5739522) (← links)
- A Decidable Class of Nested Iterated Schemata (Q5747768) (← links)
- RegSTAB: A SAT Solver for Propositional Schemata (Q5747769) (← links)
- Perfect Discrimination Graphs: Indexing Terms with Integer Exponents (Q5747777) (← links)
- OUP accepted manuscript (Q5894700) (← links)
- Combining enumeration and deductive techniques in order to increase the class of constructible infinite models (Q5927982) (← links)
- A proof procedure for separation logic with inductive definitions and data (Q6053843) (← links)
- An undecidability result for separation logic with theory reasoning (Q6161426) (← links)
- Testing the satisfiability of formulas in separation logic with permissions (Q6541165) (← links)
- Decision procedures using model building techniques (Q6560165) (← links)
- Automated deduction (Q6602250) (← links)
