IJCAR A

54 papers

YearTitle / Authors
2006A Logical Characterization of Forward and Backward Chaining in the Inverse Method.
Kaustuv Chaudhuri, Frank Pfenning, Greg Price
2006A Powerful Technique to Eliminate Isomorphism in Finite Model Search.
Xiangxue Jia, Jian Zhang
2006A Purely Functional Library for Modular Arithmetic and Its Application to Certifying Large Prime Numbers.
Benjamin Grégoire, Laurent Théry
2006A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL.
Christian Urban, Stefan Berghofer
2006A Resolution-Based Decision Procedure for
Yevgeny Kazakov, Boris Motik
2006A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA).
Erik Reeber, Warren A. Hunt Jr.
2006A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms.
Joe Hendrix, José Meseguer, Hitoshi Ohsaki
2006An Interpretation of Isabelle/HOL in HOL Light.
Sean McLaughlin
2006Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings
Ulrich Furbach, Natarajan Shankar
2006Automatic Construction and Verification of Isotopy Invariants.
Volker Sorge, Andreas Meier, Roy L. McCasland, Simon Colton
2006Automatic Termination Proofs in the Dependency Pair Framework.
Jürgen Giesl, Peter Schneider-Kamp, René Thiemann
2006Automating Proofs in Category Theory.
Dexter Kozen, Christoph Kreitz, Eva Richter
2006Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems.
Adam Koprowski, Hans Zantema
2006Blocking and Other Enhancements for Bottom-Up Model Generation Methods.
Peter Baumgartner, Renate A. Schmidt
2006CASC-J3 - The 3rd IJCAR ATP System Competition.
Geoff Sutcliffe
2006CEL - A Polynomial-Time Reasoner for Life Science Ontologies.
Franz Baader, Carsten Lutz, Boontawee Suntisrivaraporn
2006Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers.
Anna Zamansky, Arnon Avron
2006Combining Type Theory and Untyped Set Theory.
Chad E. Brown
2006Connection Tableaux with Lazy Paramodulation.
Andrey Paskevich
2006Consistency and Completeness of Rewriting in the Calculus of Constructions.
Daria Walukiewicz-Chrzaszcz, Jacek Chrzaszcz
2006Cut-Simulation in Impredicative Logics.
Christoph Benzmüller, Chad E. Brown, Michael Kohlhase
2006Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures.
Maria Paola Bonacina, Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli
2006Dynamic Logic with Non-rigid Functions.
Bernhard Beckert, André Platzer
2006Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach.
Brigitte Pientka
2006Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation.
Allen Van Gelder, Geoff Sutcliffe
2006Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics.
Robert L. Constable, Wojciech Moczydlowski
2006FaCT++ Description Logic Reasoner: System Description.
Dmitry Tsarkov, Ian Horrocks
2006First-Order Logic with Dependent Types.
Florian Rabe
2006Flyspeck I: Tame Graphs.
Tobias Nipkow, Gertrud Bauer, Paula Schultz
2006Formal Global Optimisation with Taylor Models.
Roland Zumkeller
2006Geometric Resolution: A Proof Procedure Based on Finite Model Search.
Hans de Nivelle, Jia Meng
2006Importing HOL into Isabelle/HOL.
Steven Obua, Sebastian Skalberg
2006Inferring Network Invariants Automatically.
Olga Grinchtein, Martin Leucker, Nir Piterman
2006Interpolation in Local Theory Extensions.
Viorica Sofronie-Stokkermans
2006Mathematical Theory Exploration.
Bruno Buchberger
2006Matrix Interpretations for Proving Termination of Term Rewriting.
Jörg Endrullis, Johannes Waldmann, Hans Zantema
2006On Keys and Functional Dependencies as First-Class Citizens in Description Logics.
David Toman, Grant E. Weddell
2006On the Strength of Proof-Irrelevant Type Theories.
Benjamin Werner
2006Partial Recursive Functions in Higher-Order Logic.
Alexander Krauss
2006Pitfalls of a Full Floating-Point Proof: Example on the Formal Proof of the Veltkamp/Dekker Algorithms.
Sylvie Boldo
2006Presburger Modal Logic Is PSPACE-Complete.
Stéphane Demri, Denis Lugiez
2006Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials.
Assia Mahboubi
2006Representing and Reasoning with Operational Semantics.
Dale Miller
2006Searching While Keeping a Trace: The Evolution from Satisfiability to Knowledge Compilation.
Adnan Darwiche
2006Solving Sparse Linear Constraints.
Shuvendu K. Lahiri, Madanlal Musuvathi
2006Specifying and Reasoning About Dynamic Access-Control Policies.
Daniel J. Dougherty, Kathi Fisler, Shriram Krishnamurthi
2006Stratified Context Unification Is NP-Complete.
Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
2006Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic.
Roy Dyckhoff, Delia Kesner, Stéphane Lengrand
2006System Description: GCLCprover + GeoThms.
Predrag Janicic, Pedro Quaresma
2006The MathServe System for Semantic Web Reasoning Services.
Jürgen Zimmer, Serge Autexier
2006Towards Self-verification of HOL Light.
John Harrison
2006Tree Automata with Equality Constraints Modulo Equational Theories.
Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron
2006Using the TPTP Language for Writing Derivations and Finite Interpretations.
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Allen Van Gelder
2006Verifying Mixed Real-Integer Quantifier Elimination.
Amine Chaieb