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.
13896.9 The Rhetorical Parsing, Summarization, and Generation of Natural.. - Marcu (1997)(Correct)
This thesis is an inquiry into the nature of the high-level, rhetorical structure of unrestricted
natural language texts, computational means to enable its derivation, and two applications
(in automat... / Deriving text structures -a theorem proving perspective . br section . ffl a theorem-proving problem section . ffl
12891.7 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
9577.2 Potentiality of Parallelism in Logic - Kurfeß (1991)(Correct)
The processing of knowledge is becoming a major area of applications for computer
systems. In contrast to data processing, the current stronghold of computer use, where
well-structured data are manipu... / suited for areas like automated theorem proving where the formulation of a br Bibel W. Automated Theorem Proving. Vieweg Braunschweig
9317.6 Constraint Databases: A Survey - Revesz (1998)(Correct)
Constraint databases generalize relational databases by finitely
representable infinite relations. This paper surveys the state of the art
in constraint databases: known results, remaining open prob... / of interest in the area of theorem proving is whether all possible
9231.8 Autoepistemic Logic As A Unified Basis For Nonmonotonic Reasoning - Niemelä (1993)(Correct)
Autoepistemic logic is investigated in a general setting where autoepistemic reasoning based on a given classical logic is studied. The possible sets of autoepistemic conclusions from a set of premise... / requires as a subroutine only a theorem prover for the underlying monotonic br complexity automated theorem proving. Dissertation for the
8358.9 The Complexity Of Querying Indefinite Information: Defined Relations, .. - van der Meyden (1992)(Correct)
OF THE DISSERTATION
The Complexity of Querying Indefinite Information:
Defined Relations, Recursion and Linear Order
by Ronald van der Meyden, Ph.D.
Dissertation Director: L.T. McCarty
This dissertati... / and standard first order theorem proving technology may be used to br theory and standard theorem proving technology may be used to
8084.7 PVS Bibliography - Rushby (1998)(Correct)
this report, including the BibT
E
X bibliography, are available
at http://www.csl.sri.com/pvs-bib.html. PVS users are encouraged to use the
BibT
E
X entries from these files, which are as accurate, co... / line of specification languages theorem provers and verification systems br analyzer used the Boyer-Moore theorem prover much of whose early
7640.3 Learning Logical Exceptions In Chess - Bain (1994)(Correct)
This thesis is about inductive learning, or learning from examples. The goal has
been to investigate ways of improving learning algorithms. The chess end-game
"King and Rook against King" (KRK) was ch... / was to extend resolution theorem-proving technology with methods of br considerable research effort on theorem-proving in the late 's and early
7415.2 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
7198.7 Analogy in Problem Solving - Melis, Veloso(Correct)
ion
Let P be the aspect describing time (in terms of hours and minutes) and day of week.
The aspect Q describes whether the stores are open in Germany. Then each reformulation
ae mapping a time betwe... / solving by analogy and with theorem proving by analogy. The next br reuse. Finally an approach to theorem proving by analogy is given in more
7173.2 Compositional Model Checking Of Partially Ordered State Spaces - Hazelhurst (1996)(Correct)
Symbolic trajectory evaluation (STE) --- a model checking technique based on partial order
representations of state spaces --- has been shown to be an effective model checking technique
for large circ... / were constructed integrating theorem proving and STE. Data is manipulated br . . . Theorem Proving .
7014.7 Design, Analysis and Reasoning about Tools: Abstracts from the Third.. - Nielson, (Ed.) (1993)(Correct)
s from the Third Workshop
Flemming Nielson
(editor)
October 1993
1 Introduction
The third DART workshop took place on Thursday August l9th and Friday
August 20th at the Department of Computer Science... / emphasized include automated theorem proving program analysis and fully br But we have also studied other theorem proving systems such as LP in
6869.7 Evaluating the State of the Art - Cooper, Crouch, van Eijck, Fox, van.. (1995)(Correct)
In this document we discuss the themes of the interface to semantics, underspecification,
contextual reasoning, inference and evaluation (in the sense of
determining whether something is true or false... / formal methods and theorem proving. . Practical applications br at the propositional backbone. A theorem prover for propositional logic will
6802.5 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
6713.6 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
6474.2 The TPTP Problem Library - Geoff Sutcliffe, Christian Suttner (1994)(Correct)
This paper provides a detailed description of the CNF part of the
TPTP Problem Library for automated theorem proving systems. The library is
available via Internet, and forms a common basis for deve... / Problem Library for automated theorem proving systems. The library is br experimentation with automated theorem provers. This paper explains the
6295.5 S-Semantics Approach: Theory And Applications - Bossi, Gabbrielli, Levi, Martelli (1994)(Correct)
The paper is a general overview of an approach to the semantics of logic
programs whose aim is finding notions of models which really capture the
operational semantics, and are therefore useful for de... / semantics and the theorem prover operational semantics The br of the program. Finally the theorem prover is a proof procedure which
6155.9 Analysis and Transformation of Proof Procedures - de Waal (1994)(Correct)
Automated theorem proving has made great progress during the last few decades. Proofs
of more and more difficult theorems are being found faster and faster. However, the exponential
increase in the si... / October Abstract Automated theorem proving has made great progress br search space remains for many theorem proving problems. Logic program
6109.6 Deduction in Many-Valued Logics: a Survey - Reiner Hähnle, Gonzalo Escalada-Imaz (1997)(Correct)
this article, there is considerable
activity in MVL deduction which is why we felt justified in writing this survey.
Needless to say, we cannot give a general introduction to MVL in the present
contex... / and in automated theorem proving A partial survey br can match those in classical theorem proving with respect to depth and
6037.3 Abductive Interpretation And Reinterpretation Of Natural Language.. - McRoy (1993)(Correct)
To decide how to respond to an utterance, a speaker must interpret what others have
said and why they have said it. Speakers rely on their expectations to decide whether
they have understood each othe... / real conversations using the theorem-proving capabilities of Prioritized br more directly using a theorem prover. Perhaps for this reason the
5950.9 Explaining Reasoning In Description Logics - McGuinness (1996)(Correct)
OF THE DISSERTATION
EXPLAINING REASONING IN DESCRIPTION
LOGICS
by Deborah L. McGuinness
Dissertation Director: Alexander Borgida
Knowledge-based systems, like other software systems, need to be debugg... / . . . Explanation in Theorem Proving Systems . br which use more standard theorem-proving techniques such as
5676.8 Graph Transformation for Specification and Programming - Andries, Engels, Habel, Hoffmann.. (1996)(Correct)
The framework of graph transformation combines the potentials and advantages of both, graphs and rules, to a single computational paradigm. In this paper we present some recent developments in applyin... / specification term rewriting theorem proving concurrent processes br for interpreter semantics and theorem proving facilities. The paper is
5568.1 Disjunctive Datalog - Eiter, Gottlob, Mannila (1997)(Correct)
We consider disjunctive datalog, a powerful database query language based on disjunctive logic programming. Briefly, disjunctive datalog is a variant of datalog where disjunctions may appear in the ru... / Intelligence Deduction and Theorem Proving I. . Artificial
5536.1 A Case-Analysis Approach To Disjunctive Logic Programming - Reed (1991)(Correct)
Computer Science)
A CASE-ANALYSIS APPROACH TO
DISJUNCTIVE LOGIC PROGRAMMING
by
David W. Reed
Department of Computer Science
Duke University
Date:
Approved:
Donald W. Loveland, Supervisor
Gopalan ... / logic and automated theorem proving. Since its inception in the br relevant to automated theorem proving and logic programming is the
5510.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
5403.2 Semantic Unification for Convergent Systems - Mitra (1994)(Correct)
ing AC-goals : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 66
5.4 Transformations for non-AC goals : : : : : : : : : : : : : : : : : : : : : : : : : : 67
5.5 Transformation rules f... / an important component of theorem proving and programming language br essential for simplification in theorem provers. We provide a simple
5333.8 The Search for Satisfaction - Gent, Walsh (1999)(Correct)
In recent years, there has been an explosion of research in AI into propositional
satisfiability (or Sat). There are many factors behind the increased
interest in this area. One factor is the improv... / is closely related to theorem proving refutation procedures for br term rewriting and resolution theorem proving. Zhang and Stickel have
5330.6 Constraint Simplification Rules - Frühwirth (1992)(Correct)
In current constraint logic programming systems, constraint solving is hard-wired in a "black
box". We are investigating the use of logic programs to define and implement constraint
solvers
1
. The ... / using techniques from automated theorem proving. . Constraint br using techniques from automated theorem proving. If we can prove a set of
5310.6 A Notion of Classical Pure Type System - Barthe, Hatcliff, al. (1997)(Correct)
We present a notion of classical pure type system, which extends the formalism of
pure type system with a double negation operator.
1 Introduction
It is an old idea that proofs in formal logics are c... / applications to e.g. classical theorem proving and witness extraction. br is especially useful for theorem proving. Proposition .
5197.1 Theorem-Proving for Discrete Temporal Logic - Reynolds, Dixon (1998)(Correct)
This chapter considers theorem proving for discrete temporal logics. We are interested in deciding
or at least enumerating the formulas of the logic which are valid, that is, are true in all circumsta... / Theorem-Proving for Discrete Temporal Logic br This chapter considers theorem proving for discrete temporal logics.
5185.2 Proving First-Order Equality Theorems With Hyper-Linking - Geoffrey David Alexander (1995)(Correct)
Lee and Plaisted recently developed a new automated theorem proving strategy called
hyper-linking. As part of his dissertation, Lee developed a round-by-round implementation
of the hyper-linking stra... / developed a new automated theorem proving strategy called br well with other automated theorem provers on a wide range of theorem
5088.7 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
4917.5 Constraint Programming and Database Query Languages - Kanellakis, Goldin (1994)(Correct)
The declarative programming paradigms used in constraint
languages can lead to powerful extensions of Codd's relational data
model. The development of constraint database query languages from
logica... / and inherently exponential theorem proving Example .
4876.0 Self-Checking Prover Study - Final Report - Gordon, Herbert, Hale, Harrison..(Correct)
this report includes an overview of the research and the final
deliverables funded on the SRI project. Some of these build on results of
the Computer Laboratory project and the contributions of Mr. Jo... / V Metatheory and Reflection in Theorem Proving A Survey and Critique br and Critique Extending theorem provers Metatheory and
4730.9 HPGP: High-Performance Generic Programming for Computational.. - Hong, Schreiner (1997)(Correct)
A functor is a parameterized program module i.e. a function that takes modules
as arguments and returns a module as its result. A higher-order functor
deals in the same way with modules whose componen... / II system a geometry theorem proving package was implemented br of the Edinburgh LCF theorem-proving system. In work began on
4702.7 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
4699.6 Transformations On Dependency Graphs: Formal Specification And.. - Rajan (1995)(Correct)
Dependency graphs are used to model data and control flow in hardware and
software design. In a transformational design approach, optimization and refinement
transformations are used to transform depe... / integrates model-checking and theorem-proving the two major techniques br for seamless integration of theorem-proving and modelchecking for
4627.7 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
4625.3 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
4602.9 Formal Hardware Verification By Symbolic Trajectory Evaluation - Jain (1997)(Correct)
Formal verification uses a set of languages, tools, and techniques to mathematically reason about
the correctness of a hardware system. The form of mathematical reasoning is dependent upon the
hardwar... / . . . Theorem Proving and Processor Verification . br a hybrid approach based on theorem-proving and STE STE is used
4521.4 A New Procedural Interpretation of Horn Clauses with Equality - Degtyarev, Voronkov (1994)(Correct)
We introduce the equality elimination method which is a new procedure for dealing with Horn clause
logic programs with equality. The method combines SLD-resolution with a bottom-up equation
solving. B... / are actively studied in the theorem proving and logic programming br in the field of automated theorem proving for theories with equality.
4469.6 Integrating Rule Based Reasoning and Neural Networks - Ertel, al. (1995)(Correct)
this document describes a fully integrated model
based on probability theory supported by the method of maximum entropy. It integrates
aspects of rule based reasoning and neural networks and its stren... / Control Component for the Theorem Prover SETHEO . . The br SETHEO . . The Theorem Prover SETHEO
4405.2 Rewrite Proofs and Computations - Jouannaud (1995)(Correct)
Rewriting is a general paradigm for expressing computations in various logics,
and we focus here on rewriting techniques in equational logic. When used at the proof level,
rewriting provides with a ... / which originates from algebra theorem proving and computability theory br of the method of inductive theorem proving pioneered by Musser
4353.5 The Boyer-Moore Theorem Prover and Its Interactive Enhancement - Boyer, Kaufmann, Moore (1995)(Correct)
The so-called "Boyer-Moore Theorem Prover" (otherwise known
as "Nqthm") has been used to perform a variety of verification tasks for two
decades. We give an overview of both this system and an inter... / The Boyer-Moore Theorem Prover and Its Interactive br The so-called Boyer-Moore Theorem Prover otherwise known as
4247.7 Homeomorphic Embedding for Online Termination - Leuschel (1998)(Correct)
Recently well-quasi orders in general, and homeomorphic embedding
in particular, have gained popularity to ensure the termination of program
analysis, specialisation and transformation techniques. In ... / infinite model checking or theorem proving where termination has to be br fail. In applications like theorem proving even infinite determinate
4213.2 Toward A Foundation of Disjunctive Logic Programming - Minker (1989)(Correct)
I provide a personal memoir on work that I have done and describe research
that influenced my work that led to results in the foundation of disjunctive
logic programming. I discuss my beginning experi... / Robinson Rob for automated theorem proving permitted Green and Raphael br to automating deduction in theorem provers. It was clear to me at that
4149.0 CLIN -- An Automated Reasoning System Using Clause Linking - Shie-Jue Lee (1990)(Correct)
ion : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 137
10.2.2 Specialized Decision Procedures : : : : : : : : : : : : : : : : : : : : : 138
10.2.3 Semantics : : : : : : : : : : : : : ... / . The Theorem Proving Problem br Part of the mystery in human theorem proving activity is that humans can
4130.6 Learning from previous proof experience: a survey - Denzinger, Fuchs, Goller, Schulz (1999)(Correct)
We present an overview of various learning techniques used in automated theorem provers. We characterize the main problems arising in this context and classify the solutions to these problems from pub... / techniques used in automated theorem provers. We characterize the main br for different approaches to theorem proving and place these combinations
4128.2 Efficient First-Order Semantic Deduction Techniques - Zhu (1998)(Correct)
Mathematical logic formalizes the process of mathematical reasoning. For centuries, it
has been a dream of mathematicians to do mathematical reasoning mechanically. In the
TPTP library, one finds thou... / with state of the art automated theorem provers. Theorem proving also has br art automated theorem provers. Theorem proving also has applications in
4089.5 The Distributed Artificial Intelligence Melting Pot - Durfee (1991)(Correct)
this paper to DAI, therefore, include the rigorous development of an
alternative, ecological perspective, and the idea of modifying populations rather than individuals
(what I above called "trading" r... / investigation into distributed theorem proving. In this work each theorem br proving. In this work each theorem proving agent begins with a subset of
3964.7 Proof in Flat Specifications - Padawitz(Correct)
Introduction
This chapter deals with the verification of data types. We put particular
emphasis on
ffl a uniform syntax for constructor-based specifications of both visible and
hidden data types,
f... / theory REC automated theorem proving ATP abstract data types br normal forms before a theorem prover can deal with them.
3953.5 A Taste of Rewrite Systems - Dershowitz (1993)(Correct)
This survey of the theory and applications of rewriting with equations discusses the existence
and uniqueness of normal forms, the Knuth-Bendix completion procedure and its variations, as
well as re... / first-order and inductive theorem proving. Ordinary br also be used as an equational theorem prover. Classical forward reasoning
3923.6 On the Correspondence between Neural Folding Architectures and Tree.. - Küchler (1998)(Correct)
The folding architecture together with adequate supervised training algorithms is a special
recurrent neural network model designed to solve inductive inference tasks on structured
domains. Recently, ... / et al. search control in theorem proving Goller Schulz et al. br Architecture Networks to Guide Theorem Proving. In D.D. Dankel II editor
3897.8 A Higher-order Calculus and Theory Abstraction - Luo (1988)(Correct)
ion Zhaohui Luo Department of Computer Science University of Edinburgh The King's Buildings Edinburgh EH9 3JZ, U.K. Abstract We present a higher-order calculus ECC which naturally combines Coquand-Hue... / proof development so that large theorem-proving tasks can be conquered in a br for ECC to be suitable for theorem-proving and program specification.
3864.3 Parallelism in Logic Programming - Geyer, Vargas, Dutra(Correct)
This text summarises the main research work being carried out
on the implementation of parallel logic programming systems. It concentrates
on describing techniques for exploiting and-parallelism and
o... / natural language processing theorem proving databases expert systems
3860.2 Mechanical Verification of Invariant Properties of DisCo.. - Kellomäki (1997)(Correct)
This thesis describes how invariant properties of specifications written in
the DisCo specification language can be mechanically verified. DisCo is an
object-oriented specification language based on j... / stepwise refinement. The PVS theorem prover is used for the actual br higher order logic of the PVS theorem prover. This is apparently the first
3847.3 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
3838.5 Model Checking vs. Theorem Proving: A Manifesto - Halpern, Vardi (1991)(Correct)
We argue that rather than representing an agent's knowledge as a collection
of formulas, and then doing theorem proving to see if a given formula follows from an
agent's knowledge base, it may be mo... / Model Checking vs. Theorem Proving A Manifesto Joseph Y. br of formulas and then doing theorem proving to see if a given formula
3837.6 Flow Analysis for Verifying Specifications of Concurrent and.. - Dwyer, Clarke (1999)(Correct)
This paper presents FLAVERS, a finite state verification approach that analyzes whether concurrent or
sequential programs satisfy user-defined correctness properties. In contrast to other finite-state... / using the full power of theorem proving and instead reasons over a br are usually not as powerful as theorem proving techniques but can prove a
3818.2 Overview of Datalog Extensions with Tuples and Sets - Liu (1998)(Correct)
Datalog (with negation) is the most powerful query language for relational database
with a well-defined declarative semantics based on the work in logic programming. However,
Datalog only allows inexp... / of earlier work in automatic theorem proving and artificial intelligence.
3774.3 Proof Procedures for Logic Programming - Donald W. Loveland, Gopalan Nadathur (1994)(Correct)
Proof procedures are an essential part of logic applied to artificial intelligence tasks, and
form the basis for logic programming languages. As such, many of the chapters throughout
this handbook uti... / subdiscipline called Automated Theorem Proving. While many proof procedures br proof procedures for automated theorem proving appear in Bibel Bib
3618.5 Building and Refining Abstract Planning Cases by Change of.. - Bergmann, Wilke (1995)(Correct)
Planning Cases
by Change of Representation Language
Ralph Bergmann bergmann@informatik.uni-kl.de
Wolfgang Wilke wilke@informatik.uni-kl.de
Centre for Learning Systems and Applications (LSA)
Universi... / abstraction approaches from theorem proving Plaisted br approach to the application of theorem proving to problem solving.
3614.9 Deductive Databases - Where to Now? - Liu (1996)(Correct)
Deductive databases result from the integration of database and logic programming
techniques. It combines the benefits of these two approaches, such as representational and
operational uniformity, rec... / of earlier work in automatic theorem proving and artificial intelligence.
3604.5 The IOA Language and Toolset: Support for Designing, Analyzing, and.. - Garland, Lynch (1998)(Correct)
This report describes a new language for distributed programming, the IOA language, together
with a high-level design and preliminary implementation for a suite of tools, the IOA
toolset, to support t... / variety of validation methods theorem proving model checking and br software tools verification theorem proving simulation code generation
3600.1 Mathematics in the TPTP Problem Library (v1.2.1) - Sutcliffe, Suttner(Correct)
The TPTP (Thousands of Problems for Theorem Provers) is a library of problems
for automated theorem proving (ATP) systems, for the clause normal form (CNF) of
1st order logic. A large portion of the T... / TPTP Thousands of Problems for Theorem Provers is a library of problems br of problems for automated theorem proving ATP systems for the clause
3584.4 Structure and Behaviour in Hardware Verification - Goossens (1993)(Correct)
In this paper we review how hardware has been described in the formal hardware
verification community. Recent developments in hardware description are
evaluated against the background of the use of ha... / workshop on Higher Order Logic Theorem Proving and Its Applications held in br using the Boyer-Moore theorem prover the circuit description
3581.2 An Object-Based Design Method for Concurrent Programs - Jones (1992)(Correct)
The property of a (formal) development method which gives the development process the potential
for productivity is compositionality. Interference is what makes it difficult to find compositional
deve... / experience of building a theorem proving assistant JJLM in
3534.4 Action and Change in Rewriting Logic - Martí-Oliet, Meseguer (1996)(Correct)
Rewriting logic is proposed as a logic of concurrent action and change that solves
the frame problem and that subsumes and unifies a number of previous logics of
change, including linear logic and Hor... / the general control or theorem-proving problem. Now the trouble br Approach to the Application of Theorem Proving to Problem Solving
3517.8 DDD-FM9001: Derivation of a Verified Microprocessor - Bose (1994)(Correct)
Derivation and verification represent alternate approaches to design. Derivation aims at deriving a "correct by construction" design while verification aims at constructing a post factum "proof of cor... / derivation system the Nqthm theorem prover and the COSMOS boolean br . . Theorem Proving and Proof Checking
3475.7 Multivalued Logics: A Uniform Approach to Inference in Artificial.. - Ginsberg (1988)(Correct)
This paper describes a uniform formalization of much of the current work in AI on inference systems.
We show that many of these systems, including first-order theorem provers, assumption-based truth m... / systems including first-order theorem provers assumption-based truth br same general-purpose bilattice theorem prover and differ only in the choice
3446.8 Diagrammatic Representation And Reasoning - Kulpa (1994)(Correct)
The rapidly developing field of diagrammatic knowledge representation and reasoning is
surveyed. The origins and rationale of the field, basic principles and methodologies, as well as selected
appli... / qualitative physics geometry theorem proving. . Introduction The br was the Gelernter's geometry theorem proving machine implemented as
3424.7 Constraint Query Algebras - Goldin, Kanellakis (1996)(Correct)
Constraint query languages are natural extensions of relational database query
languages. A framework for their declarative specification (constraint calculi) and efficient implementation
(low data ... / and inherently exponential theorem proving. The CDB framework while
3375.6 Efficient Constraints on Possible Worlds for Reasoning about Necessity - Stone (1997)(Correct)
this paper further the goal of building practical, efficient reasoning systems using
modal logics. The key problem in modal deduction is reasoning about the world in a
model (or scope in a proof) at w... / techniques from classical theorem-proving is offset by the fact that br used in efficient classical theorem-proving methods. The subformula
3347.4 Object-Level Substitution, Unification And Generalization In.. - Chuck C. Liang (1995)(Correct)
OBJECT-LEVEL SUBSTITUTION, UNIFICATION AND
GENERALIZATION IN META-LOGIC
CHUCK C. LIANG
Supervisor: DALE MILLER
Meta-programming in logic has had difficulty with a class of problems, which
includes po... / A Technique for Automated Theorem Proving br logical expressions as in a theorem prover forcing object-level
3343.6 Unified Versioning through Feature Logic - Zeller, Snelting (1997)(Correct)
Software Configuration Management (SCM) suffers from tight coupling between SCM versioning
models and the imposed SCM processes. In order to adapt SCM tools to SCM processes,
rather than vice versa, w... / Intelligence Deduction and theorem proving I. . Artificial
3342.6 A Unified Approach to Theory Reasoning - Baumgartner, Furbach (1992)(Correct)
Theory reasoning is a kind of two-level reasoning in automated theorem
proving, where the knowledge of a given domain or theory is separated and treated by
special purpose inference rules. We define... / reasoning in automated theorem proving where the knowledge of a br disciplines in AI is Theorem Proving. In the early days it was
3341.9 From Implicit Skills to Explicit Knowledge: A Bottom-Up Model of.. - Sun, Merrill, Peterson (1999)(Correct)
This paper presents a skill learning model Clarion. Di erent from existing models of mostly high-level
skill learning that use a top-down approach (that is, turning declarative knowledge into procedur... / from arithmetic to geometric theorem proving to account for changes br example in skill learning of theorem proving text editing LISP
3323.7 What You Always Wanted to Know About Rigid E-Unification - Anatoli Degtyarev, Andrei Voronkov (1997)(Correct)
This paper solves an open problem posed by a number of researchers: the construction of a complete
calculus for matrix-based methods with rigid E-unification. The use of rigid E-unification and
simult... / Introduction Algorithms for theorem-proving based on matings or tableaux br itself and its use in theorem proving for example Gallier et.al.
3291.8 Program Derivation by Proof Transformation - Anderson (1993)(Correct)
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a constructive logic. Under this approach, the theorem-proving process can be regarded as a program de... / programs are developed through theorem-proving in a constructive logic. br logic. Under this approach the theorem-proving process can be regarded as a
3270.3 Autonomous Agents and Collective Robotics - Chantemargue, Courant, Hirsbrunner(Correct)
this paper is twofold. First to take stock of the state of the AMoC project after three
years of research (funded by the Swiss National Foundation for Research unknown Autonomous Agents and Collective... / such as medical diagnosis theorem proving chess playing etc. However
3231.6 Efficient Propositional Reasoning - Kautz(Correct)
Introduction
A central research topic in AI is efficient propositional reasoning. This course will begin
with an overview of satisfiability testing, including theoretical results and a description of... / is obviously satisfiable. . theorem-proving find a formal proof in a br work in AI has favored theorem-proving procedures and among these
3218.4 Backtracking - Apostolico, Italiano(Correct)
Contents
1 Introduction 3
2 Models of computation 6
3 The Set Union Problem 9
4 The Worst--Case Time Complexity of a Single Operation 15
5 The Set Union Problem with Deunions 18
6 Split and the Set Un... / logic programming and theorem proving and several
3214.3 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
3198.4 An Overview of Rewrite Rule Laboratory (RRL) - Kapur, Zhang (1995)(Correct)
RRL (Rewrite Rule Laboratory) was originally developed as an environment for experimenting with automated reasoning algorithms for equational logic based on rewrite techniques. It has now matured into... / now matured into a full-fledged theorem prover which has been used to solve br nets Introduction The theorem prover RRL Rewrite Rule
3153.6 Sorted Unification And The Solution Of Semi-Linear Membership.. - Uribe (1992)(Correct)
This thesis describes a new representation for sortal constraints and a unification algorithm
for the corresponding constrained terms. Variables range over sets of terms described by systems
of set co... / the case of resolution-based theorem proving for example and simplifies br constructing resolution-based theorem provers so as to enable the
3118.4 Solving Deductive Planning Problems Using Program Analysis and.. - de Waal, Thielscher (1995)(Correct)
Two general, problematic aspects of deductive planning, namely, detecting unsolvable planning
problems and solving a certain kind of postdiction problem, are investigated. The work
is based on a resou... / with respect to a specific theorem proving problem. The result of the br prove formulas in the given theorem proving problem. One of the effects
3116.2 Reflexive Interpreters - Doyle (1978)(Correct)
The goal of achieving powerful problem solving capabilities leads to the "advice taker"
form of program and the associated problem of control. This proposal outlines an approach
to this problem based ... / calculus interpreted by a theorem proving data base. See Green br the experience of the early theorem proving efforts shows that just
3101.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
3096.6 Eye On The Prize - Nilsson (1995)(Correct)
In its early stages, the field of artificial intelligence (AI) had as
its main goal the invention of computer programs having the general
problem solving abilities of humans. Along the way, there deve... / of AI including automated theorem proving intelligent database br Approach to the Application of Theorem Proving to Problem Solving
3085.9 Program Development Schemata as Derived Rules - Anderson, Basin (1998)(Correct)
this paper may be found
on the web at http://www.tcnj.edu/¸penny/isalops.
1. Introduction unknown J. Symbolic Computation (1998) 11, 1--000
Program Development Schemata as Derived Rules
PENNY ANDERSO... / development to ordinary theorem proving where higher-order br using schemata are reduced to theorem proving in a higher-order setting.
3074.7 Axiomatizing Reflective Logics and Languages - Clavel, Meseguer (1996)(Correct)
The very success and breadth of reflective techniques underscores the need for a
general theory of reflection. At present what we have is a wide-ranging variety of reflective
systems, each explained i... / well as a variety of reflective theorem proving systems are placed within a br in theorem-proving
3071.1 Multiparadigm Programming in Oz - Müller, Müller, Van Roy (1995)(Correct)
The foundation of Prolog's success is the high abstraction level of its declarative
subset, namely first-order Horn clause logic with SLDNF resolution. What's
missing from Prolog is that little attemp... / data transformation and theorem proving. Prolog has many advantages
3061.7 Systematic Testing of Multicast Protocol Robustness - Helmy (1997)(Correct)
The past few years have witnessed unprecedented growth of the Internet. Several new service
models have been introduced since. In particular, the advent of the IP multicast technology has
contributed ... / . . . Theorem Proving . br for protocol verification are theorem proving and reachability analysis
3015.2 Linear and Unit-Resulting Refutations for Horn Theories - Peter Baumgartner (1995)(Correct)
We present a new transformation method by which a given Horn theory is transformed in such a way
that resolution derivations can be carried out which are both linear (in the sense of Prologs SLD-res... / with a model elimination theorem prover. . Introduction In br be modeled within automated theorem proving by theory reasoning calculi
3013.5 A Methodological View of Constraint Solving - Comon, al. (1997)(Correct)
Constraints are an effective tool to define sets of data by means of logical formulae.
Our goal here is to survey the notion of constraint system and to give examples of constraint systems
operating... / operations research and theorem proving. Keywords Constraint br the resolution inference rule of theorem provers. This is the case for
2996.3 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
2991.8 Automatic Analysis of Consistency between Requirements and Designs - Chechik, Gannon (1996)(Correct)
Writing requirements in a formal notation permits automatic assessment of such
properties as ambiguity, consistency, and completeness. However, verifying that
the properties expressed in requirement... / all but the smallest programs. Theorem-proving allows to check that a br state-exploration rather than theorem-proving techniques. In Inscape
2963.6 Equational Inference, Canonical Proofs, And Proof Orderings - Bachmair, Dershowitz (1992)(Correct)
We describe the application of proof orderings---a technique for reasoning about inference
systems---to various rewrite-based theorem-proving methods, including refinements of the standard
Knuth-Bendi... / various rewrite-based theorem-proving methods including br . Equational Proofs Theorem provers can often be viewed
2938.5 Symbolic Trajectory Evaluation - Hazelhurst, Seger (1996)(Correct)
ion
The main problem with model checking is the state explosion problem -- the state space grows exponentially
with system size. Two methods have some popularity in attacking this problem: compositio... / and the integration of theorem proving techniques a number of tools br STE Compositional Theory Theorem Prover FL Proof Script User
2936.0 Partial Instantiation Methods for Inference in First Order Logic - Hooker, Rago (1996)(Correct)
Satisfiability algorithms for propositional logic have improved enormously in recently years.
This increases the attractiveness of satisfiability methods for first order logic that reduce the
problem ... / as to make it more useful for theorem proving and logic programming with br Cook S.A. The complexity of theorem proving procedures Proceedings rd
2914.9 Machine-Assisted Theorem-Proving for Software Engineering - Martin (1994)(Correct)
The thesis describes the production of a large prototype proof system for Z, and a
tactic language in which the proof tactics used in a wide range of systems (including the
system described here) can ... / Machine-Assisted Theorem-Proving for Software Engineering br of Oxford. Machine-Assisted Theorem-Proving for Software Engineering
2885.5 Principles and a Preliminary Design for ML2000 - Group (1999)(Correct)
We describe the methodology and current features for ML2000, a new-generation design of ML. ML2000 adds
a number of features to Standard ML and Caml, providing better support for extensibility and cod... / with ML's roots in interactive theorem proving. ML is meant to be a
2884.9 Learning to Reason - Khardon (1994)(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... / Intelligence Deduction and Theorem Proving-deduction An earlier version br it does not use any logic or theorem proving To summarize the new
2843.4 Efficient Algorithms for MultiPolynomial Resultant - Manocha (1993)(Correct)
this paper we present efficient algorithms to compute multipolynomial
resultants and demonstrates their use for polynomial manipulation and
symbolic applications. The algorithms utilize the linear alg... / applied to automated geometry theorem proving by Wu. All these methods of br and the mechanization of theorem proving in elementary geometry.
2807.5 Inductive Theorem Proving in Theories Specified by.. - Wirth, Kühler (1995)(Correct)
We present an inference system for clausal theorem proving w.r.t. various kinds of inductive
validity in theories specified by constructor-based positive/negative-conditional equations. The reductio... / Inductive Theorem Proving in Theories Specified by br an inference system for clausal theorem proving w.r.t. various kinds of
2800.5 A Specification-Based Approach to Concurrency Analysis - Buy, Moll (1995)(Correct)
The behavior of a concurrent program often depends on the arbitrary interleaving of computations
performed by asynchronous processes. The resulting non-determinism can lead to such phenomena as
deadlo... / sufficient Y N theorem proving model checking intra-unit
2788.2 Topics In Computational Hidden State Modeling - Yianilos (1997)(Correct)
Motivated by the goal of establishing stochastic and information theoretic foundations
for the study of intelligence and synthesis of intelligent machines, this thesis probes
several topics relating t... / focusing on problems such as theorem proving and logical reasoning while
2780.6 Search Algorithms in Type Theory - Caldwell, Gent, Underwood (1998)(Correct)
In this paper, we take an abstract view of search by describing search
procedures via particular kinds of proofs in type theory. We rely on the
proofs-as-programs interpretation to extract programs fr... / much research in type theoretic theorem proving however comparatively br International Conference on Theorem Proving in Higher Order Logics.
2779.5 Static Management of Integrity in Object-Oriented Databases: Design.. - Benzaken, Schaefer (1998)(Correct)
In this paper, we propose an efficient technique to statically manage
integrity constraints in object-oriented database programming languages. We
place ourselves in the context of a simplified datab... / combined with automatic theorem proving techniques to prove the br implications we use classical theorem proving techniques the tableau
2778.5 Theory Generation for Security Protocols - Kindred, Wing (1999)(Correct)
We introduce theory generation, a new general-purpose technique for performing automated verification.
Theory generation draws inspiration from, and complements, both automated theorem proving
and sym... / and complements both automated theorem proving and symbolic model checking br is essentially a special-purpose theorem prover. It is fast and automatic
2778.2 A General Data Dependence Test for Dynamic, Pointer-Based Data.. - Hummel, Hendren (1994)(Correct)
Optimizing compilers require accurate dependence
testing to enable numerous, performance-enhancing
transformations. However, data dependence testing
is a difficult problem, particularly in the presenc... / Our test is based on theorem proving using axioms which describe br It is important to note that theorem proving in this context is
2770.5 Model-Based Diagnosis: An Overview - Mozetic (1992)(Correct)
Diagnosis is an important application area of Artificial Intelligence. First
generation expert diagnostic systems had exhibited difficulties which motivated
the development of model-based reasoning te... / Reasoning is typically based on theorem proving if a model is represented by br on the underlying ATMS-like theorem prover. In contrast our algorithm
2758.0 Survey of Anders Yeo's papers - In This(Correct)
oured graphs and
digraphs (see section 4), tournaments (see section 3) and some problems in extremal graph
theory (see section 5). I have, together with J. Bang-Jensen and J. Huang, introduced the
not... / which was the motivation for proving Theorem . which clearly
2755.0 Handling Equality in Logic Programs via Basic Folding - Degtyarev, Voronkov (1998)(Correct)
This paper further develops an approach to logic programming with equality introduced
in [DV95c]. By a logic program with equality we understand a Horn clause logic
program in which equality may occur... / are actively studied in the theorem proving and logic programming br was made by equational theorem proving methods using refinements of
2740.4 Approaches to Deductive Object-Oriented Databases - Fernandes, Paton, Williams, Bowles (1992)(Correct)
This paper is concerned with the problem of combining deductive and object-oriented features to produce a deductive
object-oriented database system which is comparable to those currently available und... / as a store of facts within a theorem-proving framework. We assume that br important problems for the theorem-proving aspects of the framework. In
2730.5 First-order Lax Logic as a Framework for Constraint Logic Programming - Fairtlough Mendler (1997)(Correct)
In this report we introduce a new proof-theoretic approach to the semantics of Constraint
Logic Programming, based on an intuitionistic first-order modal logic, called QLL. The distinguishing
feature ... / work on abstractions in theorem proving see e.g. Pla GW br systems are not in general theorem-provers HSH In this report we
2699.0 A Reduction for Automated Verification of Authentication Protocols - Stoller (1999)(Correct)
Authentication protocols (including protocols that provide key establishment) are designed
to work correctly in the presence of an adversary that can (1) perform an unbounded number
of encryptions and... / verification of such protocols. Theorem proving requires considerable
2694.3 The Nimble Type Inferencer for Common Lisp-84 - Baker (1990)(Correct)
data types model the semantic intent of the programmer
with respect to individual variable values, so that global properties of these individual values (e.g., evenness or
primeness of an integer valu... / rather than the logical theorem-proving unification techniques of br with the more difficult task of theorem-proving for the purpose of proving
2693.3 Discoveries And Experiments In The Automation Of Mathematical.. - Shults (1997)(Correct)
vii
List of Figures xii
Chapter 1. Introduction 1
1.1 Reasoning in Mathematics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1.1 Reasoning with Knowledge . . . . . . . . . . . . ... / on resolution and automated theorem proving in Vladimir Lifschitz' logic br intelligence and automated theorem proving research. It is a problem
2665.1 Rewriting Methods for Word Problems - Dershowitz (1992)(Correct)
This paper outlines various recent approaches to solving word problems.
Term orderings are used to define a terminating rewrite relation. When confluent,
that relation defines unique normal forms that... / approaches to equational theorem proving. Of course not all word br in resolution based theorem provers for the first-order
2660.0 Automated Proofs of Object Code for a Widely Used Microprocessor - Yu (1992)(Correct)
Computing devices can be specified and studied mathematically. Formal specification of computing devices has many advantages unknown 114
Automated Proofs of Object
Code For
a Widely Used Microprocesso... / Nqthm a.k.a. the Boyer-Moore Theorem Proving System. Based on this formal br . . The Theorem Prover
2658.4 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
2653.7 Structuring and Automating Hardware Proofs in a Higher-Order.. - Kumar, Schneider, Kropf (1993)(Correct)
In this article we present a structured approach to formal hardware verification
by modelling circuits at the register-transfer level using a restricted form of higher-order
logic. This restricted f... / Proofs in a Higher-Order Theorem-Proving Environment Ramayya Kumar br language as using automated theorem provers like Otter Although
2646.8 Artificial Intelligence Search Algorithms - Korf (1996)(Correct)
Introduction
Search is a universal problem-solving mechanism in artificial intelligence (AI). In AI problems,
the sequence of steps required for solution of a problem are not known a priori, but often... / salesman problem and theorem proving. In each case the task is
2646.6 Constraints in Term Algebras (Short Survey) - Comon(Correct)
this
paper.
References unknown Constraints in Term Algebras
(Short Survey)
Hubert Comon
CNRS and LRI, Bat. 490
Univ. Paris-Sud
91405 Orsay cedex, France
Unification, which consists in solving equati... / constraint system in automated theorem proving searching simultaneously br R. Nieuwenhuis and A. Rubio. Theorem proving with ordering constrained
2641.7 A Theory of Resolution - Bachmair, Ganzinger (1997)(Correct)
We review the fundamental resolution-based methods for first-order theorem
proving and present them in a uniform framework. We show that these calculi
can be viewed as specializations of non-clausal r... / methods for first-order theorem proving and present them in a uniform br behaviour of any practical theorem prover this work is the first
2639.8 Termination Of Non-Simple Rewrite Systems - Hoot (1996)(Correct)
this paper is whether one must require that the
component orderings be well-quasi-orderings (i.e., whether Theorem 3 (Special Termination) in
the [DH95] is in fact true, if not proven so.) While this ... / is an important component of theorem proving and of great interest in br refutational completeness in theorem proving. In J. H. Siekmann editor
2636.9 Social and Semiotic Analyses for Theorem Prover User Interface Design - Goguen (1999)(Correct)
We describe an approach to user interface design based on ideas from cognitive science, social
science, especially the theory of stories, and a new area tentatively called algebraic semiotics. Socia... / and Semiotic Analyses for Theorem Prover User Interface Design br for a distributed cooperative theorem proving system whose main component
2633.8 Towards Verified Systems: The SAFEMOS Project - Bowen, He, Hale, Herbert (1995)(Correct)
The collaborative safemos project has investigated the formal development of embedded systems from specification through to a real-time programming language, compilation to object code and the formal ... / Order Logic theorem proving system was used to perform br system provides an LCF-style theorem proving environment and
2608.0 Theorem Proving with Transitive Relations from a Practical Point of.. - Schorlemmer, Agusti (1995)(Correct)
Rewrite techniques have been typically applied to reason with the equality relation and have
turned out to be among the more successful approaches to equational theorem proving. In fact, it
is not onl... / Theorem Proving with Transitive Relations br approaches to equational theorem proving. In fact it is not only in
2591.6 A Temporal Logic Approach to Object Certification - Sernadas, Sernadas, Ramos (1996)(Correct)
A brief overview is made of the use of temporal logic formalisms for
specifying and verifying concurrent systems in general and information
systems in particular. The requirements imposed by object-or... / and availability of automatic theorem proving for systems querying is br and availability of automatic theorem proving for systems querying is
2587.6 Heterogeneous Analysis and Verification for Distributed Systems - Steffen, Margaria, Claßen (1995)(Correct)
In this paper we present an environment for the development of special purpose heterogeneous
analysis and verification tools, which is unique in 1) constituting a framework
for the development of appl... / bisimulation checking theorem proving and model checking but can br and or algorithms it may be a theorem prover or a code generator users
2574.6 Local and Global Relational Consistency - Dechter, van Beek (1995)(Correct)
Local consistency has proven to be an important concept in
the theory and practice of constraint networks. In this paper, we present
a new definition of local consistency, called relational consiste... / operators such as resolution in theorem proving joins in relational
2574.3 Lower and Upper Bounds for Attacks on Authentication Protocols - Stoller (1998)(Correct)
Authentication protocols (including protocols that provide key establishment) are designed to work correctly in the presence of an adversary that can (1) perform an unbounded number of encryptions (an... / verification of such protocols. Theorem proving requires considerable
2561.6 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
2545.6 Set Theory for Verification: I. From Foundations to Functions - Paulson (1998)(Correct)
A logic for specification and verification is derived from the axioms of
Zermelo-Fraenkel set theory. The proofs are performed using the proof assistant
Isabelle. Isabelle is generic, supporting sever... / Isabelle set theory generic theorem proving Ramsey's Theorem br may define new ones. A generic theorem prover offers flexibility as logical
2541.6 Refinements of Theory Model Elimination and a Variant without.. - Peter Baumgartner (1994)(Correct)
Theory Reasoning means to build-in certain knowledge about a problem domain
into a deduction system or calculus, which is in our case model elimination. Several
versions of theory model elimination (T... / in the early days of automated theorem proving Loveland It is a br deduction. There are high speed theorem provers like METEOR Astrachan and
2534.0 Determinacy and Determinacy Analysis - Hill, King (1995)(Correct)
One unique feature of logic languages, which makes them well-suited for artificial intelligence
problems, is their ability to succinctly and declaratively express non-determinacy and
hence search. Imp... / would also be of benefit to theorem provers. Many analysis and br applied to automatic theorem proving. For example in it has
2529.1 Machine-Checked Real-Time System Verificatio - Wilding (1996)(Correct)
System Lemma : : : : : : : : : : : : : : : : : : 108
7.4.2 FM9001 Reasonableness Proof : : : : : : : : : : : : : : : 109
7.4.3 FM9001 Program Proof : : : : : : : : : : : : : : : : : : 111
7.4.4 Derivi... / also known as the Boyer-Moore theorem prover. We present a scheduling br . A Mechanical Theorem Prover . Overview of Nqthm
2524.3 First-order Logic Characterization of Program Properties - Ke Wang(Correct)
A program is first-order reducible (FO-reducible) with respect to (wrt) a set of integrity
constraints if there exists a first-order theory T such that the set of models for T is exactly
the set of in... / rich reservoir of first-order theorem-proving tools provided that the br rich reservoir of first-order theorem-proving tools. In this paper we
2506.6 Static Integrity Constraint Management in Object-Oriented Database.. - Benzaken, Schaefer (1996)(Correct)
In this paper, we propose an efficient technique to statically manage integrity constraints in object-oriented database
programming languages. We place ourselves in the context of an extended version ... / implication we use a classical theorem proving technique based on the br in the field of automated theorem proving in first-order logic
2475.0 Ordered Binary Decision Diagrams and the Davis-Putnam Procedure - Uribe, Stickel (1994)(Correct)
We compare two prominent decision procedures for propositional
logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam
procedure. Experimental results indicate that the Davis-Putnam
proc... / the reach of resolutionbased theorem provers while the strength of such br can be used in refutational theorem proving or to effectively enumerate
2474.6 Logical Support for Modularisation - Diaconescu, Goguen, Stefaneas (1993)(Correct)
Modularisation is important for managing the complex structures that
arise in large theorem proving problems, and in large software and/or hardware development
projects. This paper studies some prop... / structures that arise in large theorem proving problems and in large br languages. Modularisation for theorem proving has been studied less. This
2469.6 Specification and Synthesis of Plans Using the Features and Fluents.. - Karlsson (1995)(Correct)
An autonomous agent operating in a dynamical environment will
face a number of different reasoning problems, one of which is how to
plan its actions in order to pursue its goals. For this purpose, it ... / representation and showed how theorem proving can be used to find plans br Consequently classical theorem proving techniques can be applied to
2464.1 Simultaneous Rigid E-Unification is Undecidable - Degtyarev, Voronkov (1995)(Correct)
Simultaneous rigid E-unification has been introduced in the area of theorem proving with equality.
It is used in extension procedures, like the tableau method or the connection method. Many articles
i... / been introduced in the area of theorem proving with equality. It is used in br itself and its use in theorem proving GNPS GRS GNPS
2462.8 Object Certification - Sernadas, Sernadas (1994)(Correct)
A brief overview is made of the use of temporal logic formalisms for
specifying and verifying concurrent systems in general and information
systems in particular. The requirements imposed by object-or... / and availability of automatic theorem proving for systems querying is
2461.5 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
2458.1 Unifying Verification Paradigms (Extended Abstract) - Shankar (1996)(Correct)
To appear in the Proceedings of FTRTFT'96
Natarajan Shankar
Computer Science Laboratory
SRI International
Menlo Park CA 94025 USA
shankar@csl.sri.com
URL: http://www.csl.sri.com/~shankar/
Phone:... / PVS logic the integration of theorem proving with various forms of model br and the application of theorem proving and model checking to the
2457.3 Extending Homeomorphic Embedding in the Context of Logic Programming - Leuschel (1997)(Correct)
Recently well-quasi orders in general, and homeomorphic embedding in particular,
have gained popularity to ensure the termination of program analysis,
specialisation and transformation techniques. How... / fail. In applications like theorem proving even infinite failures at br Problems in Equational Theorem Proving. PhD thesis State University
2448.5 Automated Deduction: A Technological Point of View - Peter Baumgartner, Ingo Dahn, Jürgen ..(Correct)
There are recent successes of automated deduction techniques
in various application domains, such as mathematics,
classical and nonmonotonic logics, diagnosis, planning and
within software engineerin... / sized problems. Nowadays the theorem prover community discovers br proved with the automated theorem prover EQP that each Robbins
2444.7 Efficient Specification-Based Component Retrieval - Penix, Alexander (1996)(Correct)
In this paper we present a mechanism for making specification-based component retrieval more efficient by limiting
the amount of theorem proving required at query time. This is done by using a class... / by limiting the amount of theorem proving required at query time. This br by using a specialized theorem proving tactic to prove feature
2427.2 Proceedings of the First International Workshop on PEIRCE: A.. - Ellis, (eds.) (1992)(Correct)
PEIRCE is a project aiming to build a state-of-the-art, industrial strength conceptual graphs workbench.
PEIRCE is integrating the conceptual graphs development efforts that are taking place around
th... / . . Inference Theorem-Proving Mechanisms PROOF br programming computer assisted theorem proving specification and
2422.6 Reflections on Standard ML - MacQueen (1994)(Correct)
Standard ML is one of a number of new programming languages developed in the 1980s that are seen as suitable vehicles for serious systems and applications programming. It offers an excellent ratio of ... / and tacticals to automate theorem proving and it was used as the br of systems designed to support theorem proving verification and
2419.1 Rules as Actions: A Situation Calculus Semantics for Logic Programs - Fangzhen Lin (1997)(Correct)
this paper we propose a novel semantics for logic programs in the situation
calculus. One of the advantages of our proposal is that like Clark's completion
semantics, it is explicitly formulated in cl... / and it is problematic for the theorem proving system -it must reason br . C. C. Green. Application of theorem proving to problem solving. In
2414.2 Handling Equality in Logic Programming via Basic Folding - Degtyarev, Voronkov (1995)(Correct)
We introduce a new approach to handling equality in logic
programs. The method is based on the transformation of equational logic
programs into logic programs without equality using basic superposit... / are actively studied in the theorem proving and logic programming br was made by equational theorem proving methods using refinements of
2406.3 Inducing Search Methods from Proofs - Lopes (1997)(Correct)
A methodology is introduced for the automatic generation of proof
search strategies in automated deduction.
Examples are given by the application of this methodology to generate
proof search strategie... / Keywords. methods theorem proving automated deduction br deduction based on tactical theorem proving and sequent calculus
2391.4 Generalization of Clauses under Implication - Idestam-Almquist (1995)(Correct)
In the area of inductive learning, generalization is a main operation, and the usual
definition of induction is based on logical implication. Recently there has been a rising
interest in clausal repre... / Lloyd and or Automatic Theorem Proving Chang Lee Gallier br Symbolic Logic and Mechanical Theorem Proving. Academic Press London.
2387.3 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
2387.0 Abstraction and Constraints: Two Sides of the Same Coin - Walton (1997)(Correct)
ion and Constraints:
Two Sides of the Same Coin
M.Walton
November 1997
University of Sheffield
Department of Computer Science
Technical Report CS-97-18
Abstraction and Constraints:
Two Sides of the... / use in automated theorem-proving. That is to say for a given br verification and synthesis and theorem proving. The notions of
2381.6 A General Approach to Bottom-Up Computation of Disjunctive Semantics - Stefan Brass, Jürgen Dix (1995)(Correct)
Our goal is to derive bottom-up query-evaluation algorithms
from abstract properties of the underlying negation semantics. In this
paper, we demonstrate our approach for the disjunctive stable model... / a set of formulas standard theorem proving techniques can be used we br comp Phi Any theorem prover can be used to check that
2379.7 A Survey of Computational Differential Algebra - Mishra(Correct)
In this note, we explore the computational aspects of several problems in
differential algebra with concrete applications in dynamics and motionplanning
problems in robotics, automatic synthesis of co... / successfully used in geometric theorem proving the ideas of H-bases and br also found applications in theorem proving elimination
2377.2 Project Project: Tools for Program Analysis and Comprehension - Harman, Danicic, Jones..(Correct)
We argue for a `question--and--answer' approach to source code analysis
based upon program projection. With our approach, the questions
concern the behaviour of a program with respect to a projection ... / functions f and g. Using theorem-proving techniques however these br married with simple theorem-proving ability and standard program
2374.8 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
2367.4 Computational Complexity and Induction for Partial Computable.. - Robert Constable (1997)(Correct)
An adequate theory of partial computable functions should provide a basis for defining
computational complexity measures and should justify the principle of computational induction
for reasoning abo... / and semantics Theorem proving systems based on type theory br object may be constructed. Many theorem provers based on constructive logic
2357.5 JML: a Java Modeling Language - Leavens, Baker, Ruby (1998)(Correct)
JML is a behavioral interface specification language tailored to Java. It also allows
assertions to be intermixed with Java code, as an aid to verification and debugging.
JML is designed to be used ... / the mathematical logic used for theorem proving. . Outline Section