McAllester, David A.Overview
Publication Timeline
Most widely held works by
David A McAllester
Automated deduction  CADE17 : 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 1720, 2000 : proceedings
by David A McAllester
(
Book
)
15 editions published in 2000 in English and held by 271 WorldCat member libraries worldwide This book constitutes the refereed proceedings of the 17th International Conference on Automated Deduction, CADE17, held in Pittsburgh, Pennsylvania, USA, in June 2000. The 24 revised full research papers and 15 system descriptions presented were carefully reviewed and selected from 53 paper submissions and 20 system description submissions. Also included are contributions corresponding to invited talks and tutorials. The accepted papers cover a variety of topics related to theorem proving and its applications such as proofcarrying code, cryptographic protocol verification, model checking, cooperating decision procedures, program verification, and resolution
Logic for programming and automated reasoning : 6th International Conference, LPAR'99, Tbilisi, Georgia, September 610, 1999 : proceedings
by H Ganzinger
(
Book
)
13 editions published between 1999 and 2007 in English and held by 259 WorldCat member libraries worldwide This book constitutes the refereed proceedings of the 6th International Conference on Logic Programming and Automated Reasoning, LPAR'99, held in Tbilisi, Georgia in September 1999. The 23 revised full papers presented were carefully reviewed and selected from 44 submissions. Among the topics addressed are logic programming, constraint logic programming, complexity aspects, logical inference search, model checking, formal specification, rewriting, practical reasoning, Horn clauses, linear logic, partial evalutation, etc
Ontic : a knowledge representation system for mathematics
by David A McAllester
(
Book
)
6 editions published between 1987 and 1989 in English and Undetermined and held by 254 WorldCat member libraries worldwide Ontic is an interactive system for developing and verifying mathematics. Ontic's verification mechanism is capable of automatically finding and applying information from a library containing hundreds of mathematical facts. Starting with only the axioms of ZermeloFraenkel set theory, the Ontic system has been used to build a data base of definitions and lemmas leading to a proof of the Stone representation theorem for Boolean lattices. The Ontic system has been used to explore issues in knowledge representation, automated deduction, and the automatic use of large data bases. Keywords: Cognitive models; Inference; Compilers; Programming languages; Stone representation theorem; Automated reasoning
Logic for programming and automated reasoning : 6th International Conference, LPAR '99, Kiev, Ukraine, September 610, 1999 : proceedings
by International Conference on Logic Programming and Automated Reasoning
(
Book
)
1 edition published in 1999 in English and held by 11 WorldCat member libraries worldwide
A three valued truth maintenance system
by David A McAllester
(
Book
)
2 editions published in 1978 in English and held by 7 WorldCat member libraries worldwide
Natural language based inference procedures applied to Schubert's steamroller
by Robert Givan
(
Book
)
2 editions published in 1991 in English and held by 5 WorldCat member libraries worldwide Abstract: "We have previously argued that the syntactic structure of natural language can be exploited to construct powerful polynomial time inference procedures. This paper supports the earlier arguments by demonstrating that a natural language based polynomial time procedure can solve Schubert's steamroller in a single step."
An outlook on truth maintenance
by David A McAllester
(
Book
)
1 edition published in 1980 in English and held by 5 WorldCat member libraries worldwide
Lifting transformations
by David A McAllester
(
Book
)
2 editions published in 1991 in English and held by 5 WorldCat member libraries worldwide Abstract: "Lifting is a well known technique in resolution theorem proving, logic programming, and term rewriting. In this paper we formulate lifting as an efficiencymotivated program transformation applicable to a wide variety of nondeterministic procedures. This formulation allows the immediate lifting of complex procedures, such as the DavisPutnam algorithm, which are otherwise difficult to lift. We treat both classical lifting, which is based on unification, and various closely related program transformations which we also call lifting transformations. These nonclassical lifting transformations are closely related to constraint techniques in logic programming, resolution, and term rewriting. Formulating these techniques as transformations on nondeterministic programs expands the range of procedures to which the techniques can be easily applied."
Boolean classes
by David A McAllester
(
Book
)
2 editions published in 1986 in English and held by 4 WorldCat member libraries worldwide Objectoriented programming languages all involve the notions of class and object. The authors extend the notion of class so that any Boolean combination of classes is also a class. Boolean classes allow greater precision and conciseness in naming the class of objects governed by a particular method. A class can be viewed as a predicate which is either true or false of any given object. U nlike predicates however classes have an inheritance hierarchy which is known at compile time. Boolean classes extend the notion of class, making classes more like predicates, while preserving the compile time computable inheritance hierarchy. (Author)
Tractable inference relations
by Robert Givan
(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide We have not found any natural examples of local rule sets that fail to be inductively local. However, we show here that locality, as a property of rule sets, is undecidable in general."
Systematic nonlinear planning
by David A McAllester
(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide Systematicity is achieved through a simple modification of Tate's procedure."
Taxonomic syntax for first order inference
by David A McAllester
(
Book
)
3 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide Most knowledge representation languages are based on classes and taxonomic relationships between classes. Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas in first order predicate calculus. Although designers of knowledge representation languages often express an intuitive feeling that there must be some advantage to representing facts as taxonomic relationships rather than first order formulas, there are few, if any, technical results supporting this intuition. We attempt to remedy this situation by presenting a taxonomic syntax for first order predicate calculus and a series of theorems that support the claim that taxonomic syntax is superior to classical syntax. Keywords: Artificial intelligence, Theorem proving, Inference, Automated reasoning
Automatic recognition of tractability in inference relations
by David A McAllester
(
Book
)
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide A procedure is given for recognizing sets of inference rules that generate polynomial time decidable inference relations. The procedure can automatically recognize the tractability of the inference rules underlying congruence closure. The recognition of tractability for that particular rule set constitutes mechanical verification of a theorem originally proved independently by Kozen and Shostak. The procedure is algorithmic, rather than heuristic, and the class of automatically recognizable tractable rule sets can be precisely characterized. A series of examples of rule sets whose tractability is nontrival, yet machine recognizable, is also given. The technical framework developed here is reviewed as a first step toward a general theory of tractable inference relations. Keywords: Statistical inference, Machine inference, Theorem proving, Automated reasoning, Polynomial time decidability, Inference rules, Proof systems, Mechanical verification. (KR)
Truth maintenance systems
by Johan De Kleer
(
Book
)
2 editions published between 1988 and 1989 in English and held by 3 WorldCat member libraries worldwide
Observations on cognitive judgments
by David A McAllester
(
Book
)
1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide Abstract: "It is obvious to anyone familiar with the rules of the game of chess that a king on an empty board can reach every square. It is true, but not obvious, that a knight can reach every square. Why is the first fact obvious but the second fact not? This paper presents an analytic theory of a class of obviousness judgments of this type. Whether or not the specifics of this analysis are correct, it seems that the study of obviousness judgments can be used to construct integrated theories of linguistics, knowledge representation, and inference."
Automated deduction  CADE17 : 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 2000 : proceedings
by International Conference on Automated Deduction
(
Book
)
1 edition published in 2000 in English and held by 3 WorldCat member libraries worldwide
Uncertainty in artificial intelligence : proceedings of the Twentyfifth Conference (2009), June 1821, 2009, Montreal, Quebec
by Conference on uncertainty in artificial intelligence
(
Book
)
1 edition published in 2009 in English and held by 3 WorldCat member libraries worldwide
Grammar rewriting
by David A McAllester
(
Book
)
1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide Abstract: "We present a term rewriting procedure based on congruence closure that can be used with arbitrary equational theories. This procedure is motivated by the pragmatic need to prove equations in equational theories where confluence can not be achieved. The procedure uses context free grammars to represent equivalence classes of terms. The procedure rewrites grammars rather than terms and uses congruence closure to maintain certain congruence properties of the grammar. Grammars provide concise representations of large term sets. Infinite term sets can be represented with finite grammars and exponentially large term sets can be represented with linear sized grammars
Truth maintenance systems
by David A McAllester
(
Book
)
1 edition published in 1988 in English and held by 3 WorldCat member libraries worldwide
Nonexpressibility of fairness and signaling
by David A McAllester
(
Book
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide Abstract: "In this paper we establish new expressiveness results for indeterminate dataflow primitives. We consider choice primitives with three differing fairness assumptions and show that they are strictly inequivalent in expressive power. We also show that the ability to announce choices enhances the expressive power of two of the primitives. These results are proved using a very crude semantics and thus apply in any reasonable theory of process equivalence." more
fewer
Audience Level
Related Identities
Associated Subjects
Artificial intelligence Automatic theorem proving Cognitive science Computer networks Computer science Expert systems (Computer science) Inference Information storage and retrieval systemsMathematics Knowledge representation (Information theory) Logic Logic, Symbolic and mathematical Logic design Logic programming MathematicsData processing Natural language processing (Computer science) Ontic (Computer system) Planning Problem solving Problem solvingData processing Reasoning Rewriting systems (Computer science) Truth maintenance systems Uncertainty (Information theory)

Alternative Names
MacAllester, David A.
McAllester, David
McAllester, David A.
Languages
Covers
