This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
755.6 Rewrite Systems - Dershowitz, Jouannaud (1990)(Correct)
Completion Completion has recently been put in a more abstract framework [ Bachmair-et al, 1986 ] , an approach we adopt here. As in traditional proof theory (cf. [ Takeuti, 1987 ] ), proofs are reduc... / computation automated theorem proving program specification and br approaches to equational theorem proving. In this context completion
739.1 Pushing the Envelope: Planning, Propositional Logic, and Stochastic.. - Kautz, Selman (1996)(Correct)
Planning is a notoriously hard combinatorial search
problem. In many interesting domains, current planning
algorithms fail to scale up gracefully. By combining
a general, stochastic search algorithm a... / is not amenable to general theorem-proving techniques. The origin of br using first-order resolution theorem-proving Green failed to scale
736.3 The TPTP Problem Library - Christian B. Suttner, Geoff Sutcliffe (1999)(Correct)
This report provides a detailed description of the TPTP Problem Library for automated
theorem proving systems. The library is available via Internet, and forms
a common basis for development of and ex... / Problem Library for automated theorem proving systems. The library is br experimentation with automated theorem provers. This report provides
675.8 Term Rewriting Systems - Klop (1992)(Correct)
Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter ... / decidability of word problems theorem proving The aim of the present br or between R rules.Prove Theorem. Let R R be
672.7 Symbolic Model Checking without BDDs - Biere, Cimatti, Clarke, Zhu (1999)(Correct)
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of
reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system.
In thi... / verification techniques e.g. theorem proving model checking is largely
587.9 A New Method for Solving Hard Satisfiability Problems - Selman, Levesque, Mitchell (1992)(Correct)
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated probl... / traditionally been viewed as theorem-proving problems as model-finding br is obviously satisfiable. . theorem-proving find a formal proof in a
565.9 GOLOG: A Logic Programming Language for Dynamic Domains - Levesque, Reiter, Lespérance, .. (1997)(Correct)
This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied... / it is also problematic for the theorem proving system as it must reason br programs using conventional theorem proving techniques as in Manna and
529.4 Intelligence without representation - Brooks (1991)(Correct)
Artificial intelligence research has foundered on the issue of representation. When intelligence is approached in an incremental manner, with strict reliance on interfacing to the real world through p... / problems symbolic algebra theorem proving and other formal systems
472.4 Formal Methods: State of the Art and Future Directions - Clarke, Wing (1996)(Correct)
We survey recent progress in the development of mathematical techniques for specifying and verifying complex hardware and software systems. Many of these techniques are capable of handling industrial-... / verification model checking theorem proving Abstract We survey br new tools such as more powerful theorem provers and model checkers than were
442.6 The Well-Founded Semantics for General Logic Programs - Van Gelder, Ross, Schlipf (1991)(Correct)
A general logic program (abbreviated to "program" hereafter) is a set of rules that have both positive and negative subgoals. It is common to view a deductive database as a general logic program consi... / Intelligence Deduction and Theorem Proving -logic programming br operation of resolution theorem proving or the law of the
441.9 Logic Programming in a Fragment of Intuitionistic Linear Logic - Hodas, Miller (1994)(Correct)
When logic programming is based on the proof theory of intuitionistic logic, it is natural
to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of
the form D oe G fr... / examples taken from theorem proving natural language parsing br by programs in many ways. In theorem provers they can be used to store
381.8 Unifying SAT-based and Graph-based Planning - Kautz, Selman (1999)(Correct)
The Blackbox planning system unifies the planning
as satisfiability framework (Kautz and Selman
1992, 1996) with the plan graph approach to
STRIPS planning (Blum and Furst 1995). We show
that STRIPS p... / early attempts to use general theorem provers to solve planning problems br described as a way to make theorem-proving practical. In other work the
320.9 Logical Foundations of Object-Oriented and Frame-Based Languages - Kifer, Lausen, Wu (1990)(Correct)
We propose a novel formalism, called Frame Logic (abbr., F-logic), that accounts in a clean and
declarative fashion for most of the structural aspects of object-oriented and frame-based languages.
The... / Intelligence Deduction and theorem proving-deduction logic br logic programming mechanical theorem proving General Terms Languages
319.1 Construction of abstract state graphs with PVS - Graf, Saidi (1997)(Correct)
We describe in this paper a method based on abstract interpretation
which, from a theoretical point of view, is similar to the splitting methods proposed
in [DGG93, Dam96] but the weaker abstract tr... / to do this we use the Pvs theorem prover SOR and our br correct before using the Coq theorem prover GvdP HSV and on Pvs
300.0 Systematic Nonlinear Planning - McAllester, Rosenblitt (1991)(Correct)
This paper presents a simple, sound, complete, and
systematic algorithm for domain independent STRIPS
planning. Simplicity is achieved by starting with a
ground procedure and then applying a general, ... / were based on resolution theorem proving and inherited their lifted br the development of resolution theorem proving Robinson Lifting is
291.4 BLACKBOX: A New Approach to the Application of Theorem Proving to.. - Kautz, Selman (1998)(Correct)
sentations (McCarthy and Hayes 1969)
should go hand-in-hand with the study of practical
reasoning algorithms, rather than being carried out
as a separate activity.)
ffl The use of powerful new genera... / Approach to the Application of Theorem Proving to Problem Solving Henry br early attempts to use general theorem provers to solve planning problems
285.7 Dependent Types in Practical Programming - Xi (1998)(Correct)
Programming is a notoriously error-prone process, and a great deal of evidence in practice has demonstrated that the use of a type system in a programming language can effectively detect program error... / for teaching me automated theorem proving and providing me with the br a research assistant on TPS a theorem proving system based on higherorder
272.7 Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999)(Correct)
We present a family of abstract-interpretation algorithms that are capable of determining "shape invariants" of programs that perform destructive updating on dynamically allocated storage. The main id... / Logic-mechanical theorem proving General Terms Algorithms
263.2 A Logic Programming Language with Lambda-Abstraction, Function.. - Miller (1991)(Correct)
ion, Function Variables, and Simple Unification Dale Miller Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104--6389 USA Abstract: It has been argued else... / meta-programs including theorem provers and program transformers br such unification in the theorem proving system Isabelle. Pfenning and
262.8 Towards a Completeness Result for Model Checking of Security.. - Lowe (1998)(Correct)
Gavin Lowe
Department of Mathematics and Computer Science
University of Leicester, University Road
Leicester, LE1 7RH, UK
E-mail: gavin.lowe@mcs.le.ac.uk
Abstract
Model checking approaches to the... / combine aspects of theorem proving and model checking to try to
245.4 Experience with Predicate Abstraction - Das, Dill, Park (1999)(Correct)
ion
?
Satyaki Das
1
, David L. Dill
1
, and Seungjoon Park
2
1
Computer Systems Laboratory, Stanford University, Stanford, CA 94305
2
RIACS, NASA Ames Research Center, Moffett Field, CA 94035... / provides a means for combining theorem proving and model checking br of verifying a design using a theorem prover. This technique was
244.8 A Spatial Logic based on Regions and Connection - Randell, Cui, Cohn (1992)(Correct)
We describe an interval logic for reasoning
about space. The logic simplifies an earlier
theory developed by Randell and Cohn, and
that of Clarke upon which the former was
based. The theory suppor... / reasoned about using a direct theorem proving implementation of the theory br a Challenge for Automated Theorem Provers in proc. of CADE
222.8 Eliminating Array Bound Checking Through Dependent Types - Xi, Pfennig (1998)(Correct)
We present a type-based approach to eliminating array bound
checking and list tag checking by conservatively extending
Standard ML with a restricted form of dependent types.
This enables the programme... / also form the basis of general theorem proving and verified program
221.2 Proving Java Type Soundness - Syme (1997)(Correct)
Syntax of JavaS primitive-type = bool --- char --- short --- int --- long --- float --- double simple-reference-type = class-name --- interface-name component-type = simple-reference-type --- primitiv... / before we proceed. Like all theorem provers the tool we use called br are rarely provided by the theorem proving community. Researchers will
220.2 Local Search Strategies for Satisfiability Testing - Selman, Kautz, Cohen (1995)(Correct)
It has recently been shown that local search is surprisingly good at
finding satisfying assignments for certain classes of CNF formulas [24]. In
this paper we demonstrate that the power of local sea... / many tasks were formulated as theorem proving problems and therefore
202.8 Experimental results on the crossover point in random 3sat - Crawford, Auton (1996)(Correct)
Determining whether a propositional theory is satisfiable is a prototypical example
of an NP-complete problem. Further, a large number of problems that occur in
knowledge-representation, learning, pla... / is also the essential task of a theorem prover though there is no a-priori br a-priori reason to expect that theorem proving problems fall into any
194.2 HYTECH: The Next Generation - Henzinger, Ho, Wong-Toi (1995)(Correct)
We describe a new implementation of HyTech
1
, a symbolic model checker
for hybrid systems. Given a parametric description of an embedded system as a collection
of communicating automata, HyTech a... / machine-assisted theorem proving Sha model checking
187.6 A Fold for All Seasons - Sheard, Fegaras (1993)(Correct)
Generic control operators, such as fold, can be generated from algebraic type definitions. The class of types to which these techniques are applicable is generalized to all algebraic types definable i... / optimization and theorem proving. In addition a generic br optimization and theorem proving. For example ffl
182.9 On evaluating decision procedures for modal logic - Hustadt, Schmidt (1997)(Correct)
This paper reports on empirical performance analysis of four modal theorem provers on benchmark suites of randomly generated formulae. The theorem provers tested are the Davis-Putnam-based procedure K... / analysis of four modal theorem provers on benchmark suites of br generated formulae. The theorem provers tested are the
181.8 A Meta-notation for Protocol Analysis - Cervesato, Durgin, Lincoln.. (1999)(Correct)
Most formal approaches to security protocol analysis are
based on a set of assumptions commonly referred to as the
"Dolev-Yao model." In this paper, we use a multiset rewriting
formalism, based on lin... / assumptions are used in theorem proving modelchecking methods br search-based analysis and theorem-proving analysis of protocols.
179.0 CLASSIC: A Structural Data Model for Objects - Borgida, Brachman, McGuinness.. (1989)(Correct)
classic is a data model that encourages the description of objects not only in terms of their relations to other known objects, but in terms of a level of intensional structure as well. The classic la... / this problem is equivalent to theorem proving for first order logic and br out as full generalpurpose theorem proving using predicates like
178.7 Automatic SAT-Compilation of Planning Problems - Ernst, Millstein, Weld (1997)(Correct)
Recent work by Kautz et al. provides tantalizing
evidence that large, classical planning problems
may be efficiently solved by translating them into
propositional satisfiability problems, using stocha... / formulation of planning as theorem proving Green most br C. Green. Application of theorem proving to problem solving. In
171.0 Specification Matching of Software Components - Zaremski, Wing (1995)(Correct)
ing with credit is permitted. To copy otherwise, to republish, to post on
servers, to redistribute to lists, or to use any component of this work in other works, requires prior
specific permission and... / first-order logic we rely on theorem proving to determine match and br pre-post-conditions theorem proving subtyping specification
168.1 Encoding Plans in Propositional Logic - Kautz, McAllester, Selman (1996)(Correct)
In recent work we showed that planning problems
can be efficiently solved by general propositional
satisfiability algorithms (Kautz and Selman
1996). A key issue in this approach is the
development of... / notionof lifting from the theorem-proving community. This new encoding br to clauses in resolution theorem proving. Theorem A lifted SAT
165.9 Planning for Temporally Extended Goals - Bacchus, Kabanza (1997)(Correct)
this paper appears in Proceedings of AAAI '96, pp. 1215-1222.
F. Bacchus and F. Kabanza / Temporally Extended Goals 2
is, of course, necessary if the agent is to be able to accomplish a range of tas... / work has viewed planning as a theorem proving problem. In this approach the br a plan exists. Planning as theorem proving has to date suffered from
165.9 Solution of the Robbins Problem - McCune (1997)(Correct)
In this article we show that the three equations known as commutativity, associativity,
and the Robbins equation are a basis for the variety of Boolean algebras. The problem
was posed by Herbert Rob... / found automatically by EQP a theorem-proving program for equational logic. br was found by EQP an automated theoremproving program for equational logic.
165.7 Model Checking Timed Automata - Yovine (1998)(Correct)
The theory of timed automata provides a formal framework
to model and to verify the correct functioning of real-time systems.
Among the different verification problems that have been investigated
wi... / verification in contrast to theorem proving which is used to mean
165.4 STeP: the Stanford Temporal Prover - Manna, Anuchitanukul.. (1994)(Correct)
We describe the Stanford Temporal Prover (STeP), a system being developed to
support the computer-aided formal verification of concurrent and reactive systems
based on temporal specifications. Unlike ... / Theorem-proving support . br invariant generation and theorem-proving support for establishing
163.6 The propositional formula checker HeerHugo - Groote (1999)(Correct)
HeerHugo is a propositional formula checker
1
, that determines whether a given formula is satisfiable
or not. Its name comes from the dutch railway station Heerhugowaard, as it was developed
to val... / in the area of automatic theorem proving. Introduction In br experience with the first order theorem prover otter led to the
160.4 Controlled Integration of the Cut Rule into Connection Tableau Calculi - Letz, Mayr, Goller (1994)(Correct)
In this paper techniques are developed and compared which increase the inferential power
of tableau systems for classical first-order logic. The mechanisms are formulated in the framework of
connect... / Using the framework of the theorem prover SETHEO we have implemented br folding down. Key words. Theorem proving first-order logic tableaux
158.8 Logic Programming in the LF Logical Framework - Pfenning (1991)(Correct)
this paper we describe Elf, a meta-language intended for environments dealing
with deductive systems represented in LF.
While this paper is intended to include a full description of the Elf core langu... / applications of Elf includes theorem proving and proof transformation in br a logic program corresponds to theorem proving in a meta-logic but a
154.5 Abstracting Cryptographic Protocols with Tree Automata - David (1999)(Correct)
ing Cryptographic Protocols with Tree
Automata #
David Monniaux
David.Monniaux@ens.fr
Laboratoire d'Informatique de l'
Ecole Normale Superieure +
& SRI International, Computer science laboratory ... / yield proofs of secrecy and theorem proving costly We propose a new br a protocol the other methods theorem proving model checking are based
145.4 Complexity and expressive power of logic programming - Dantsin, Eiter, Gottlob, Voronkov (1999)(Correct)
This paper surveys various complexity and expressiveness results on different forms of
logic programming. The main focus is on decidable forms of logic programming, in particular,
propositional logi... / based on work in automated theorem proving Green Kowalski br C. The Application of Theorem Proving to Question-Answering
142.8 Modelling and Analysis of Security Protocols - Ryan, Zakiuddin (2001)(Correct)
We outline the aims and principle results of a research programme aimed at developing tools and
techniques for the analysis and design of security protocols. The aim was to move away from specially
ta... / B-method Action Systems and theorem proving using PVS are also br part of the project the use of theorem proving supported by PVS was also
142.2 Proving Properties of States in the Situation Calculus - Reiter (1993)(Correct)
In the situation calculus, it is sometimes necessary to prove that
certain properties are true in all world states accessible from the initial
state. This is the case for some forms of reasoning about... / of planning views this as a theorem proving task Green To obtain br in contrast to the standard theorem-proving account of plan synthesis
142.0 Experiments in Theorem Proving and Model Checking for Protocol.. - Havelund, Shankar (1996)(Correct)
Communication protocols pose interesting and difficult challenges for
verification technologies. The state spaces of interesting protocols are either
infinite or too large for finite-state verificatio... / Experiments in Theorem Proving and Model Checking for br checking and state exploration. Theorem proving is also not effective since
131.9 An Industrial Strength Theorem Prover for a Logic Based on Common Lisp - Kaufmann, Moore (1997)(Correct)
ACL2 is a re-implemented extended version
of Boyer and Moore's Nqthm and Kaufmann's Pc-Nqthm,
intended for large scale verification projects. This paper
deals primarily with how we scaled up Nqthm's l... / An Industrial Strength Theorem Prover for a Logic Based on Common br verification automatic theorem proving computational logic
127.6 Finding Hard Instances of the Satisfiability Problem: A Survey - Cook, Mitchell (1997)(Correct)
Finding sets of hard instances of propositional satisfiability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we conside... / As the dual of propositional theorem proving it is amenable to the proof br Stephen Cook. The complexity of theorem proving procedures. In Proc. rd
127.2 Group-Invariant Percolation on Graphs - Benjamini, Lyons, Peres, Schramm (1999)(Correct)
Let G be a closed group of automorphisms of a graph X . We
relate geometric properties of G and X , such as amenability and unimodularity,
to properties of G-invariant percolation processes on X , s... / constant. The key tool in proving Theorem . and many other results br used this technique in order to prove Theorem . for trees X he showed
125.7 Towards an Understanding of Hill-climbing Procedures for SAT - Gent, Walsh (1993)(Correct)
Recently several local hill-climbing procedures for propositional satisfiability
have been proposed, which are able to solve large and difficult
problems beyond the reach of conventional algorithms ... / refutational theorem proving Much of the interest in br S.A. Cook. The complexity of theorem proving procedures. In Proceedings
125.7 Java light is Type-Safe - Definitely - Nipkow, von Oheimb (1998)(Correct)
Java `ight is a large sequential sublanguage of Java. We
formalize its abstract syntax, type system, well-formedness
conditions, and an operational evaluation semantics. Based
on this formalization, w... / have been done formally in the theorem prover Isabelle HOL. Thus this paper br specified and verified in the theorem prover Isabelle HOL In the
118.1 Analysis of the Internet Key Exchange Protocol Using the NRL Protocol .. - Meadows (1999)(Correct)
In this paper we show how the NRL Protocol Analyzer,
a special-purpose formal methods tool designed
for the verification of cryptographic protocols, was used
in the analysis of the Internet Key Exchan... / of state exploration and theorem proving techniques was used to the br language improvements to the theorem prover and improvements to the
118.1 On Proving Safety Properties by Integrating Static Analysis, Theorem.. - Rusu, Singerman (1999)(Correct)
ion
V. Rusu
y
E. Singerman
SRI International, Menlo Park, California, USA
Abstract. We present a new approach for proving safety properties of reactive systems, based on
tight interaction between... / Integrating Static Analysis Theorem Proving and Abstraction V. Rusu br between static analysis theorem proving and abstraction techniques.
115.9 Completeness and Consistency in Hierarchical State-Based Requirements - Heimdahl, Leveson (1996)(Correct)
This paper describes methods for automatically analyzing formal, state-based requirements
specifications for some aspects of completeness and consistency. The approach
uses a low-level functional form... / the languages used in the theorem proving approach such as process br can be addressed by using a theorem prover. Currently however the
115.9 A Tableau Calculus for Minimal Model Reasoning - Niemelä (1996)(Correct)
The paper studies the automation of minimal model inference, i.e.,
determining whether a formula is true in every minimal model of the
premises. A novel tableau calculus for propositional minimal mode... / procedure is invoked the theorem-proving task might be limited in a br clauses using a model generation theorem prover MGTP which is a parallel and
110.6 Planning Control Rules for Reactive Agents - Kabanza, Barbeau, St-Denis (1997)(Correct)
A traditional approach for planning is to evaluate goal statements over state trajectories
modeling predicted behaviors of an agent. This paper describes a powerful extension of
this approach for hand... / generating a reactive plan with theorem proving techniques Pnueli Rosner br the entire state space. The theorem proving approach is limited by the
109.0 Exploiting Positive Equality in a Logic of Equality with.. - Bryant, German, Velev (1999)(Correct)
In using the logic of equality with unininterpreted functions to verify
hardware systems, specific characteristics of the formula describing the correctness
condition can be exploited when deciding ... / for their logic based on theorem proving search methods. It uses br decision procedures based on theorem proving search methods especially
104.3 Modal Logics for Qualitative Spatial Reasoning - Brandon Bennett (1996)(Correct)
Spatial reasoning is essential for many AI applications. In most existing systems the representation
is primarily numerical, so the information that can be handled is limited to precise quantitative d... / to be tackled by existing theorem proving techniques. From a br L. Catach. Tableaux A general theorem prover for modal logics. Journal of
103.4 Experiments with Proof Plans for Induction - Bundy, van Harmelen, Hesketh, Smaill (1992)(Correct)
The technique of proof plans, is explained. This technique is used to guide automatic
inference in order to avoid a combinatorial explosion. Empirical research is described to test
this technique in... / this technique in the domain of theorem proving by mathematical induction. br theorems is high. Keywords Theorem proving mathematical induction
101.4 Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux - Bry, Yahya (1996)(Correct)
Herbrand models for clausal theories are useful in several areas of computer science. In most cases, however, the conventional model generation algorithms are inappropriate because they generate nonmi... / computer science. In automated theorem proving models can assist in making br provers. In automated theorem proving and program verification
101.4 Simplified and Improved Resolution Lower Bounds - Beame, Pitassi (1996)(Correct)
We give simple new lower bounds on the lengths of
Resolution proofs for the pigeonhole principle and for
randomly generated formulas. For random formulas,
our bounds significantly extend the range of ... / problem of propositional theorem proving. The most well-studied and br implementations of Resolution as theorem provers although in this case the
99.9 CASL: A Guided Tour of its Design - Mosses (1999)(Correct)
Casl is an expressive language for the specification of functional
requirements and modular design of software. It has been designed
by CoFI, the international Common Framework Initiative for alge... / code prototyping theorem-proving libraries reuse br Static semantic analysis and theorem proving for Casl. In th Workshop
91.4 Combining Symbolic Model Checking with Uninterpreted Functions for.. - Sergey Berezin (1998)(Correct)
We present a new approach to the verification of hardware systems
with data dependencies using temporal logic symbolic model checking. As a
benchmark we take Tomasulo's algorithm [10] for out-of-ord... / proven formally with the PVS theorem prover. Introduction Modern br of the state explosion problem. Theorem proving alone usually
91.3 Memory-Efficient Algorithms for the Verification of Temporal.. - Courcoubetis, Vardi, Wolper.. (1992)(Correct)
This paper addresses the problem of designing memory-efficient
algorithms for the verification of temporal properties of finite-state
programs. Both the programs and their desired temporal properties
... / verification is to use a theorem-prover for an appropriate logic. br cf. Unfortunately theorem-proving systems are semi-automated at
91.3 Deductive Composition of Astronomical Software from Subroutine.. - Stickel, Waldinger, Lowry.. (1994)(Correct)
Automated deduction techniques are being used in a system called
Amphion to derive, from graphical specifications, programs composed
from a subroutine library. The system has been applied to construct... / domain theory by an automated theorem prover SNARK. An applicative br of automated reasoning or theorem proving-are applied to the
89.8 Model checking for infinite state systems using data abstraction.. - Dingel, Filkorn (1995)(Correct)
A method combining data abstraction, model checking and theorem proving is presented. It provides a semi-automatic, formal framework for proving arbitrary linear time temporal logic properties of infi... / style reasoning and theorem proving Jurgen Dingel and br model checking and theorem proving is presented. It provides a
87.4 An Extended Calculus of Constructions - Luo (1990)(Correct)
This thesis presents and studies a unifying theory of dependent types ECC ---
Extended Calculus of Constructions. ECC integrates Coquand-Huet's (impredicative)
calculus of constructions and Martin-Lof... / is the strong normalization theorem proved by using Girard-Tait's br for pragmatic applications in theorem-proving and program specification and
86.9 Implicit Induction in Conditional Theories - Bouhoula, Rusinowitch (1995)(Correct)
We propose a new procedure for proof by induction in conditional theories where case analysis is simulated by term rewriting. This technique reduces considerably the number of variables of a conjectur... / easy lemmas. keywords Theorem proving Term rewriting systems br the only signicant automated theorem proving system for induction.
85.7 CASL: From Semantics to Tools - Mossakowski (2000)(Correct)
CASL, the common algebraic specification language, has been
developed as a language that subsumes many previous algebraic specification
frameworks and also provides tool interoperability. CASL is ... / conversion to LaTeX and theorem proving for CASL specifications. To br which are implemented by theorem-proving tools Formatted
85.7 A Survey on Knowledge Compilation - Cadoli, Donini (1998)(Correct)
this paper
we survey recent results in knowledge compilation of
propositional knowledge bases. We first define and limit the
scope of such a technique, then we survey exact and approximate
knowledge c... / Logic and Automated Theorem Proving. For an introduction to the br such as lemmaizing in theorem proving as knowledge compilation
85.1 Event Calculus Planning Revisited - Shanahan (1997)(Correct)
In 1969 Cordell Green presented his seminal
description of planning as theorem proving with the
situation calculus. The most pleasing feature of Green's
account was the negligible gap between high-lev... / description of planning as theorem proving with the situation calculus. br the ideal of planning via theorem proving in a modern guise. In
85.0 A Prolog Technology Theorem Prover: Implementation by an Extended.. - Stickel (1987)(Correct)
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete
for the full first-order predicate calculus. It differs from Prolog in its use of unification
with the occurs check... / A Prolog Technology Theorem Prover Implementation by an br Abstract A Prolog technology theorem prover PTTP is an extension of
84.0 Theorem Proving with Ordering and Equality Constrained Clauses - Nieuwenhuis, Rubio (1995)(Correct)
constraint strategies and saturation
Given a signature F , below we denote by S the set of all clauses built over F , and
similarly by C the set of all constraints, and by EC the set of all equality ... / - Theorem Proving with Ordering and Equality br useful for making parts of the theorem proving process explicit leading to
82.7 Applying Formal Methods to the Analysis of a Key Management Protocol - Meadows (1992)(Correct)
In this paper we develop methods for analyzing key management and authentication protocols using
techniques developed for the solutions of equations in a term rewriting system. In particular, we descr... / systems do not emphasize the theorem-proving techniques that would be br tool implementing specialized theorem-proving techniques originally
81.4 GSAT and Dynamic Backtracking - Ginsberg, McAllester (1994)(Correct)
There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as GSAT; the other contains systematic approaches that use a poly... / examples include propositional theorem proving map coloring and scheduling
81.1 Hyper Tableaux - Peter Baumgartner, Ulrich Furbach.. (1996)(Correct)
This paper introduces a variant of clausal normal form tableaux that
we call "hyper tableaux". Hyper tableaux keep many desirable features of analytic
tableaux while taking advantage of the central ... / clauses. In saturation based theorem proving the latter turned out to be br systems are high-performance theorem provers and a parallel version of
81.1 On Shostak's Decision Procedure for Combinations of Theories - Cyrluk, Lincoln, Shankar (1996)(Correct)
Decision procedures are increasingly being employed for deciding
or simplifying propositional combinations of ground equalities involving
uninterpreted function symbols, linear arithmetic, arrays, a... / feedback and comments. in theorem proving applied to program br to automatic and semi-automatic theorem provers and proof checkers has clear
81.1 Formalizing Space Shuttle Software Requirements - Crow, Di Vito (1996)(Correct)
This paper describes two case studies in which requirements
for new flight-software subsystems on NASA's
Space Shuttle were analyzed, one using standard formal
specification techniques, the other usin... / verified using standard theorem-proving techniques. By contrast br a very effective interactive theorem prover that uses decision procedures
79.9 Adaptive Behavior in Autonomous Agents - Ziemke (1998)(Correct)
This paper gives an overview of the bottom-up approach to artificial intelligence
(AI), commonly referred to as behavior-oriented AI. The behavior-oriented approach,
with its focus on the interaction ... / such as medical diagnosis theorem proving or chess. This methodology
79.9 A Decision Procedure for Bit-Vector Arithmetic - Barrett, Dill, Levitt (1998)(Correct)
Bit-vector theories with concatenation and extraction have
been shown to be useful and important for hardware verification.
We have implemented an extended theory which
includes arithmetic. Although d... / Other formal methods such as theorem proving and model checking have been br have been used extensively but theorem provers suffer from a lack of
79.9 InVeSt: A Tool for the Verification of Invariants - Bensalem, Lakhnech, Owre (1998)(Correct)
ions: The abstraction module implements the method presented in [1] for
computing abstractions of infinite state systems. For a given concrete system and a given abstraction
function, it computes an a... / approach. . It integrates the theorem prover PVS with the br understand that our use of the theorem-prover PVS is limited to discharging
79.9 Compiling with Proofs - Necula (1998)(Correct)
One of the major challenges of building software systems is to ensure that the
various components fit together in a well-defined manner. This problem is exacerbated
by the recent advent of software ... / certifying compilation theorem proving decision procedures proof br loop invariants that enable a theorem-proving agent to prove non-trivial
78.2 Reasoning with Models - Khardon, Roth (1996)(Correct)
We develop a model-based approach to reasoning, in which the knowledge base is represented
as a set of models (satisfying assignments) rather than a logical formula, and the set of queries
is restrict... / views reasoning as a kind of theorem proving process and is based on the br with which one can perform theorem proving efficiently
78.2 A Calculus for and Termination of Rippling - David Basin (1996)(Correct)
Rippling is a type of rewriting developed for inductive theorem proving that uses
annotations to direct search. Rippling has many desirable properties: for example, it is highly
goal directed, usual... / developed for inductive theorem proving that uses annotations to br Induction Inductive Theorem Proving Term Rewriting. .
78.2 Modular Properties of Composable Term Rewriting Systems - Ohlebusch (1995)(Correct)
this paper we prove several new modularity results for unconditional and conditional
term rewriting systems. Most of the known modularity results for the former systems
hold for disjoint or constructo... / synthesis and automated theorem proving. In an outstanding paper
78.2 Extracting Text from Proof - Coscoy, Kahn, Théry (1995)(Correct)
this paper, we will be concerned with proof assistants that construct a proof object, i.e. a data structure that explicitly represents the proof of facts established with the system. Proof objects are... / are popular in the automatic theorem proving community while natural br why it is popular in interactive theorem provers and the obvious candidate
78.2 Extracting Text from Proofs - Coscoy, Kahn, Thery (1995)(Correct)
In this paper, we propose a method for presenting formal proofs in
an intelligible form. We describe a transducer from proof objects (-terms in the
Calculus of Constructions) to pseudo natural langu... / are popular in the automatic theorem proving community while natural br it is popular in interactive theorem provers and the obvious candidate
76.5 Problem Structure in the Presence of Perturbations - Gomes, Selman (1997)(Correct)
Recent progress on search and reasoning procedures
has been driven by experimentation on computationally
hard problem instances. Hard random problem
distributions are an important source of such in... / in the area of automated theorem proving Fujita et al. Lam et
76.5 PROTEIN: A PROver with a Theory Extension INterface - Peter Baumgartner, Ulrich Furbach (1994)(Correct)
PROTEIN (PROver with a Theory Extension INterface) is a PTTPbased
first order theorem prover over built-in theories. Besides various standardrefinements
known for model elimination, PROTEIN also off... / is a PTTPbased first order theorem prover over built-in theories. br PROTEIN is a complete theorem prover for first order clause logic.
76.5 Reusing Proofs - Kolbe, Walther (1994)(Correct)
1
We develop a learning component for a theorem
prover designed for verifying statements by mathematical induction.
If the prover has found a proof, it is analyzed yielding
a so-called catch. The c... / a learning component for a theorem prover designed for verifying br component can be developed. Theorem proving by mathematical induction
76.0 Integrating Decision Procedures into Heuristic Theorem Provers: A.. - Boyer, Moore (1985)(Correct)
We discuss the problem of incorporating into a heuristic theorem prover a decision procedure for a fragment
of the logic. An obvious goal when incorporating such a procedure is to reduce the search sp... / Procedures into Heuristic Theorem Provers A Case Study of Linear br incorporating into a heuristic theorem prover a decision procedure for a
75.3 ACL2: An Industrial Strength Version of Nqthm - Kaufmann, Moore (1996)(Correct)
ACL2 is a reimplemented extended version of Boyer and Moore's
Nqthm and Kaufmann's Pc-Nqthm, intended for large scale verification
projects. However, the logic supported by ACL2 is compatible with the... / Austin TX . y The theorem prover used in this work was br of Nqthm is its lack of theorem proving power if it would quickly
74.2 Conflict Resolution for Air Traffic Management: a Study in.. - Tomlin, Pappas, Sastry (1998)(Correct)
Air Traffic Management (ATM) of the future allows for the possibility of free flight, in
which aircraft choose their own optimal routes, altitudes, and velocities. The safe resolution
of trajectory co... / trajectories or deductive theorem proving techniques which prove br model checking and theorem proving Control theoretic
74.2 Theorem Proving Modulo - Dowek, Hardin, Kirchner (1998)(Correct)
Theorem proving modulo" is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of wider i... / Et En Automatique Theorem Proving Modulo Gilles Dowek br April Th Eme Theorem Proving Modulo Gilles Dowek
74.2 Inference and Computational Semantics - Blackburn, Bos, Kohlhase, de Nivelle (1998)(Correct)
This paper discusses inference in computational semantics. We argue that stateof
-the-art methods in first-order theorem proving and model building are of direct
relevance to inference for natural lan... / methods in first-order theorem proving and model building are of br Computational Semantics Theorem Proving Model Building
72.7 The asymptotic determinant of the discrete Laplacian - Kenyon (1999)(Correct)
We compute the asymptotic determinant of the discrete Laplacian on a simply-connected rectilinear
region in R
2
. Specifically, for each ffl ? 0 let H ffl be the subgraph of fflZ
2
whose vertices ... / Part of the motivation for proving Theorem is to validate a certain br context. The techniques used to prove Theorem can be applied to the
72.4 Model Checking Software Systems: A Case Study - Wing, Vaziri-Farahani (1995)(Correct)
Model checking is a proven successful technology for verifying hardware. It works, however, on only finite state machines, and most software systems have infinitely many states. Our approach to applyi... / Motivation Theorem Proving and Model Checking br between these two objects theorem proving and model checking. We argue
72.3 Free Variable Tableaux for Propositional Modal Logics - Beckert, Goré (1997)(Correct)
We present a sound, complete, modular and lean labelled
tableau calculus for many propositional modal logics where the labels
contain "free" and "universal" variables. Our "lean" Prolog implementati... / technique for first-order theorem proving-both theoretically and br Traditional tableau-based theorem provers developed during the last
72.1 Introducing OBJ - Goguen, Winkler, Meseguer.. (1993)(Correct)
This is an introduction to OBJ, describing its philosophy, its syntax, its history, and aspects of
its semantics, both logical and operational. Many examples are given, using Release 2 of OBJ3,
which ... / and allows OBJ to be used as a theorem prover. OBJ is based upon order br this is very useful for theorem proving applications. Finally OBJ
72.1 Equational Term Graph Rewriting - Ariola, Klop (1993)(Correct)
We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism
is phrased in terms of the notion of bisimulation, which is well-known in process algebra and ... / programming automated theorem proving and proof theory. Term
70.1 Implementing Tactics and Tacticals in a Higher-Order Logic.. - Amy Felty (1993)(Correct)
We argue that a logic programming language with a higher-order intuitionistic logic
as its foundation can be used both to naturally specify and implement tactic style
theorem provers. The language ext... / and implement tactic style theorem provers. The language extends br starting point for implementing theorem provers and proof systems that can
69.5 Formal Methods and their Role in the Certification of Critical Systems - Rushby (1995)(Correct)
This report is based on one prepared as a chapter for the FAA Digital Systems
Validation Handbook (a guide to assist FAA Certification Specialists with
Advanced Technology Issues).
1
Its purpose is ... / or checked by computer see theorem proving There are many formal br q.v.must be employed. Theorem proving and proof checking. Given a
68.5 Generating Finite-State Abstractions of Reactive Systems using.. - Colon, Uribe (1998)(Correct)
ions of
Reactive Systems using Decision Procedures
?
Michael A. Col'on and Tom'as E. Uribe
Computer Science Department, Stanford University
Stanford, CA 94305
colon---uribe@cs.stanford.edu
Abstract... / generated interactively using theorem proving based on the refinement of br domain. Instead of using theoremproving to explore the abstract
68.0 Verification of Real-Time Systems using Linear Relation Analysis - Halbwachs, Proy, Roumanoff (1997)(Correct)
Linear Relation Analysis [CH78] is an abstract interpretation devoted to the automatic
discovery of invariant linear inequalities among numerical variables of a program. In this
paper, we apply such a... / based on general or dedicated theorem proving techniques e.g.AL br state exploration and to theorem proving. In the finite state case
68.0 Verifying Out-of-Order Executions - Damm, Pnueli (1997)(Correct)
The paper presents an approach to the specification and verification of out-of-order
execution in the design of micro-processors. Ultimately, the appropriate statement of correctness
is that the out-o... / relying on interactive theorem proving such as GM ORSS br Introduction to HOL A Theorem Proving Environment for Higher-Order
66.6 INKA: The Next Generation - Hutter, Sengler (1996)(Correct)
The INKA system is a first-order theorem prover with induction
based on the explicit induction paradigm. Since 1986 when a
first version of the INKA system was developed there have been many
improve... / The INKA system is a first-order theorem prover with induction based on the br The INKA system is a first-order theorem prover with induction based on the
66.6 Effective Theorem Proving for Hardware Verification - Cyrluk, Rajan, Shankar, Srivas (1994)(Correct)
The attractiveness of using theorem provers for system design
verification lies in their generality. The major practical challenge
confronting theorem proving technology is in combining this general... / Effective Theorem Proving for Hardware Verification br The attractiveness of using theorem provers for system design
64.1 The Muse Approach to Or-Parallel Prolog - Ali, Karlsson (1994)(Correct)
Muse (Multi-sequential Prolog engines) is a simple and efficient approach to Orparallel
execution of Prolog programs. It is based on having several sequential Prolog
engines, each with its local addre... / expert systems theorem proving br semigroup is a theorem proving program for studying the
63.9 SCOTT: A Model-Guided Theorem Prover - John Slaney (1993)(Correct)
SCOTT (Semantically Constrained Otter) is a
resolution-based automatic theorem prover for
first order logic. It is based on the high performance
prover OTTER by W. McCune and
also incorporates a m... / SCOTT A Model-Guided Theorem Prover John Slaney Automated br is a resolution-based automatic theorem prover for first order logic. It is
63.7 A Logic Programming System for Non-monotonic Reasoning - Alferes, Damásio, Pereira (1995)(Correct)
The evolution of Logic Programming semantics has included the introduction of a new
explicit form of negation, beside the older implicit (or default) negation typical of Logic
Programming. The richer ... / the development of automated theorem proving which took up the promise of br to find simple and efficient theorem proving strategies Horn clause
63.7 Theorems and Algorithms: An Interface between Isabelle and Maple - Ballarin, Homann, Calmet (1995)(Correct)
Solving sophisticated mathematical problems often requires algebraic algorithms and theorems. However, there are no environments integrating theorem provers and computer algebra systems which consiste... / are no environments integrating theorem provers and computer algebra br approaches towards introducing theorem proving into CAS is an extension of
63.6 A HOL Conversion for Translating Linear Time Temporal Logic to.. - Schneider, Hoffmann (1999)(Correct)
We present an embedding of linear time temporal logic LTL in HOL together with an elegant translation of LTL formulas into equivalent #-automata. The translation is completely implemented by HOL rules... / decision procedures in the HOL theorem prover. On the other hand the br this reason we need interactive theorem provers such as HOL for the
63.6 Optimal Lower Bounds for Quantum Automata and Random Access Codes - Ashwin Nayak (1999)(Correct)
Consider the finite regular language Ln = fw0 j w 2 f0; 1g
; jwj ng. In [2] it was shown that while
this language is accepted by a deterministic finite automaton of size O(n), any one-way quantum ... / string. The technique used in proving Theorem . also yields a bound for br of quantum automata We now prove Theorem . using this framework. The
61.8 An Empirical Analysis of Search in GSAT - Gent, Walsh (1993)(Correct)
We describe an extensive study of search in GSAT, an approximation
procedure for propositional satisfiability. GSAT performs greedy hillclimbing
on the number of satisfied clauses in a truth assignm... / interpretation refutational theorem proving planning This paper is
61.8 Equational Reasoning and Term Rewriting Systems - Plaisted (1993)(Correct)
ordering structures and computational complexity. Technical
Report CSD-TR-621, University of London, May 1990.
[Che81] P. Chew. Unique normal forms in term rewriting systems with repeated variables. I... / First-order theorem proving br reasoning in general theorem proving programs. We also touch on
60.3 Fundamentals Of Deductive Program Synthesis - Manna, Waldinger (1992)(Correct)
An informal tutorial is presented for program synthesis, with an emphasis on deductive methods. According to this approach, to construct a program meeting a given specification, we prove the existence... / transformation specifications theorem proving. Abstract An informal br the deductive-tableau system a theorem-proving framework particularly
60.3 Forming Concepts for Fast Inference - Kautz, Selman (1992)(Correct)
Knowledge compilation speeds inference by creating tractable approximations of a knowledge
base, but this advantage is lost if the approximations are too large. We show how learning
concept generaliza... / unknown or choose to do full theorem proving with the original theory. In br S. A. Cook. The complexity of theorem-proving procedures. In Proceedings
59.5 XBarnacle: Making Theorem Provers More Accessible - Helen Lowe (1997)(Correct)
Introduction
XBarnacle was built to meet the challenge of incorporating interactive features in the
automated theorem prover CLAM whilst preserving the advantages of automation.
Many people are not a... / XBarnacle Making Theorem Provers More Accessible Helen br features in the automated theorem prover CLAM whilst preserving the
59.2 Agent-Based Software Engineering - Mike Wooldridge (1994)(Correct)
ion
. An agent in AOP (as in DAI) is an
autonomous concurrently executing reactive
process...
Autonomy: agents execute without direct human
or other intervention, and have control over
their own sta... / mechanism e.g.goal-directed theorem proving figure out what to do br reduces to constructive theorem proving show that j is
59.2 Rewrite Techniques for Transitive Relations - Bachmair, Ganzinger (1994)(Correct)
We propose inference systems for dealing with transitive
relations in the context of resolution-type theorem
proving. These inference mechanisms are based
on standard techniques from term rewriting an... / the context of resolution-type theorem proving. These inference mechanisms br used in rewrite-based theorem provers. A key to the practicality
59.0 HiLog: A Foundation for Higher-Order Logic Programming - Chen, Kifer, Warren (1989)(Correct)
We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic. HiLog has a higher-order syntax and allows arbitra... / semantics resolution theorem proving database languages br programming instead of general theorem proving with HiLog. By a logic
57.9 Five Axioms of Alpha-Conversion - Gordon, Melham (1996)(Correct)
We present five axioms of name-carrying lambda-terms identified
up to alpha-conversion---that is, up to renaming of bound variables.
We assume constructors for constants, variables, application and ... / of Alpha Conversion'in Theorem Proving in Higher Order Logics th br with binding operators within a theorem prover. The difficulty of correctly
57.9 Computing Circumscription Revisited: A Reduction Algorithm - Doherty (1995)(Correct)
In recent years, a great deal of attention has been devoted to logics of "commonsense"
reasoning. Among the candidates proposed, circumscription has been perceived as an elegant
mathematical technique... / approach are a proposal for a theorem prover for circumscription by br and then applying classical theorem-proving techniques to the resulting
57.7 Constructing Specification Morphisms - Smith (1993)(Correct)
This paper is part of a broader research program to explore a mechanizable model of software development based on algebraic specifications and specification morphisms. An algebraic specification (or s... / the source theory. First-order theorem-proving techniques are used to br allows us to use theorem-proving technology to construct
57.1 Object-Oriented First-Order Logic - Amir (2001)(Correct)
First-Order Logic (FOL) provides richness of representation,
but is unwieldy in modeling large, complex
tasks. On the other hand, the Object-Oriented
paradigm has been successful in treating large, co... / are then incorporated into the theorem-proving process of the receiving br Prolog while FOL has no theorem proving ow that one can generalize
57.1 Subtypes for Specifications: Predicate Subtyping in PVS - Rushby, Owre, Shankar (1998)(Correct)
A specification language used in the context of
an effective theorem prover can provide novel features that
enhance precision and expressiveness. In particular, typechecking
for the language can explo... / in the context of an effective theorem prover can provide novel features br can exploit the services of the theorem prover. We describe a feature called
56.8 Unification in the Union of Disjoint Equational Theories: Combining.. - Baader, Schulz (1992)(Correct)
Most of the work on the combination of unification algorithms for the union of disjoint equational theories has been restricted to algorithms which compute finite complete sets of unifiers. Thus the d... / an important role in automated theorem provers with built in theories br of constraint approaches to theorem proving see e.g.Bu term
56.7 Symbolic Analysis for Parallelizing Compilers - Haghighat (1994)(Correct)
Symbolic Domain
The objects in our abstract symbolic domain are canonical symbolic expressions. A
canonical symbolic expression is a lexicographically ordered sequence of symbolic
terms. Each symboli... / of finite differences and theorem-proving techniques based on number br number theory and theorem-proving methods. Symbolic analysis
56.7 On Proof Normalization in Linear Logic - Galmiche, Perrier (1994)(Correct)
We present a proof-theoretic foundation for automated deduction in linear logic. At first,
we systematically study the permutability properties of the inference rules in this logical
framework and exp... / or program synthesis through theorem proving. As a matter of fact br of correct programs using a theorem proving approach in constructive
56.7 On the Occur-check Free Prolog Programs - Apt, Pellegrini (1994)(Correct)
Machine
is used. This tag maintains information about the context in which a variable
is used. This makes possible to optimize the generated code by avoiding calls to
the occur-check routine at the co... / intelligence Deduction and theorem proving-logic programming br clause is nicely moded. Thus to prove Theorem . it suffices to prove the
56.7 An Oxford Survey of Order Sorted Algebra - Goguen, Diaconescu (1994)(Correct)
this paper has actually been executed, and most of the
output is also included. In addition, we present some new results about overloaded OSA and
about Mosses's unified algebra.
We emphasize the follo... / that using sorts in automatic theorem proving can be an advantage because br can greatly speed up certain theorem proving problems OSA adds to
56.7 VCR: A VDM-based software component retrieval tool - Fischer, Kievernagel, Struckmann (1994)(Correct)
We present a tool which allows implicit VDM specifications to be used as search keys for the retrieval of software components. A preprocessing phase utilizes signature matching to filter promising can... / candidates and feeds them into a theorem prover. Validated obligations denote br specification matching theorem proving model searching.
55.0 A HOL Extension of GNY for Automatically Analyzing Cryptographic.. - Brackin (1996)(Correct)
This paper describes a Higher Order Logic (HOL) theory formalizing an extended version of the Gong, Needham, Yahalom (GNY) belief logic, a theory used by software that automatically proves authenticat... / using the standard HOL theorem-proving tools thus does not depend br The collection of standard HOL theorem-proving tools is large powerful
55.0 Semantic Foundations for Embedding HOL in Nuprl - Howe (1996)(Correct)
We give a new semantics for Nuprl's constructive type theory that justifies a useful embedding of the logic of the HOL theorem prover inside Nuprl. The embedding gives Nuprl effective access to most... / of the logic of the HOL theorem prover inside Nuprl. The embedding br and HOL are interactive theorem proving systems with a number of
55.0 Elements of Mathematical Analysis in PVS - Dutertre (1996)(Correct)
This paper presents the formalization of some elements of
mathematical analysis using the PVS verification system. Our main motivation
was to extend the existing PVS libraries and provide means of
m... / similar developments using other theorem provers. Introduction PVS is br language coupled with a theorem prover designed for efficient
55.0 Interpreting Message Flow Graphs - Ladkin, Leue (1995)(Correct)
We give a semantics for Message Flow Graphs (MFGs), which play the role for interprocess
communication that Program Dependence Graphs play for control flow in parallel processes.
MFGs have been used... / methods usually employ theorem-proving techniques which are
55.0 Efficient Validity Checking for Processor Verification - Robert Jones (1995)(Correct)
We describe an efficient validity checker for the quantifier-free
logic of equality with uninterpreted functions. This logic is well
suited for verifying microprocessorcontrol circuitry since it allow... / Wil Although today's theorem provers could be used in theory to br in the context of more general theorem-proving systems. Nelson and Oppen
55.0 Integrating Logical Functions with ILF - Dahn, Gehne, Honigmann, Walther, Wolf (1995)(Correct)
This is a description of the system ILF developed at the Humboldt-University at
Berlin
1
. ILF is a system that integrates automated theorem provers, proof tactics
for interactive deductive systems ... / system that integrates automated theorem provers proof tactics for br . Integration of Automated Theorem Provers
55.0 Elf: A Language for Logic Definition and Verified Metaprogramming - Pfenning (1989)(Correct)
We describe Elf, a metalanguage for proof manipulation
environments that are independent of any particular
logical system. Elf is intended for meta-programs
such as theorem provers, proof transformers... / for meta-programs such as theorem provers proof transformers or type br of logics and interactive theorem proving in LF. EFS provides a nice
54.5 A New Method for Consequence Finding and Compilation in Restricted.. - Val (1999)(Correct)
SFK (skip-filtered, kernel) resolution is a new method
for finding "interesting" consequences of a first order
clausal theory \Sigma, namely those in some restricted target
language LT . In its more r... / little attention in the theorem proving literature. However and as br are advantageous for theorem proving but this is not so clear
54.5 The Warshall Algorithm and Dickson's Lemma: Two Examples of realistic .. - Ulrich Berger Helmut (1999)(Correct)
By means of two well-known examples it is demonstrated that the
method of extracting programs from proofs is manageable in practise and may yield
efficient and sometimes unexpected programs. The War... / implemented in the interactive theorem prover Minlog developed at the br in interactive and automated theorem proving evolve provably correct
54.3 Design Goals for ACL2 - Kaufmann, Moore (1994)(Correct)
ACL2 is a theorem proving system under development at Computational Logic, Inc., by the authors of the Boyer-Moore system, Nqthm, and its interactive enhancement, Pc-Nqthm, based on our perceptions of... / Abstract ACL is a theorem proving system under development at br describe the ACL logic theorem prover interface implementation
54.3 Combining Symbolic Constraint Solvers on Algebraic Domains - Kirchner, Ringeissen (1994)(Correct)
ion An atomic constraint p ? (t 1 ; : : : ; t m ) is decomposed into a conjunction of pure atomic constraints by introducing new equations of the form (x = ? t), where t is an alien subterm in the con... / logic programming and theorem proving the development of br For instance in first-order theorem proving free constants and function
53.6 Verification of a Multiplier: 64 Bits and Beyond - Kurshan, Lamport (1993)(Correct)
Verifying a 64-bit multiplier has a computational complexity
that puts it beyond the grasp of current finite-state algorithms, including
those based upon homomorphic reduction, the induction princip... / and bdd fixed-point algorithms. Theorem proving while not bound by the same br circuit and using TLP a theorem prover based on the Temporal Logic
51.5 Analytica - A Theorem Prover for Mathematica - Clarke, Zhao (1993)(Correct)
Analytica is an automatic theorem prover for theorems in elementary analysis. The prover
is written in Mathematica language and runs in the Mathematica environment. The goal
of the project is to use a... / Analytica -A Theorem Prover for Mathematica Edmund br U.S. government. Keywords Theorem Prover Symbolic computation
51.5 Simple LPO constraint solving methods - Robert Nieuwenhuis (1993)(Correct)
We present simple techniques for deciding the satisfiability of lexicographic path
ordering constraints under two different semantics: solutions built over the given
signature and solutions in extende... / Keywords Automatic theorem proving. Terminology Let F br in rewriting and ordered theorem proving methods in first-order logic.
51.4 A Science of Reasoning - Bundy (1991)(Correct)
This paper addresses the question of how we can understand reasoning in general and
mathematical proofs in particular. It argues the need for a high-level understanding of
proofs to complement the l... / of the science to automatic theorem proving x before summarising br reflecting on the processes of theorem proving e.g. Polya We list
51.4 TAME: A PVS Interface to Simplify Proofs for Automata Models - Archer, Heitmeyer, Sims (1998)(Correct)
Although a number of mechanical provers have been introduced and applied widely by academic researchers,
these provers are rarely used in the practical development of software. For mechanical provers ... / in using TAME to provide theorem proving support for the SCR Software br Introduction A good theorem prover interface has several goals.
51.4 Symbolic Simulation: an ACL2 Approach - Moore (1998)(Correct)
Executable formal specification can allow engineers to test
(or simulate) the specified system on concrete data before the system is
implemented. This is beginning to gain acceptance and is just the... / is somewhat contrarian in the theorem proving and formal methods br of the Boyer-Moore Pure Lisp theorem prover where it was called