McAllester, David A.
Overview
Works:  34 works in 124 publications in 1 language and 1,102 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other 
Classifications:  QA76.9.A96, 510.28563 
Publication Timeline
.
Most widely held works by
David A McAllester
Ontic : a knowledge representation system for mathematics by
David A McAllester(
Book
)
15 editions published between 1987 and 1989 in English and Undetermined and held by 256 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
15 editions published between 1987 and 1989 in English and Undetermined and held by 256 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
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 247 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
15 editions published in 2000 in English and held by 247 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
)
26 editions published between 1999 and 2007 in English and held by 217 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 6th International Conference on Logic Programming & Automated Reasoning, LPAR'99, held in Tbilisi, Georgia in September 1999. The 23 revised full papers presented were carefully reviewed & 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
26 editions published between 1999 and 2007 in English and held by 217 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 6th International Conference on Logic Programming & Automated Reasoning, LPAR'99, held in Tbilisi, Georgia in September 1999. The 23 revised full papers presented were carefully reviewed & 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
The use of equality in deduction and knowledge representation by
David A McAllester(
Book
)
6 editions published in 1980 in English and held by 9 WorldCat member libraries worldwide
This report describes a system which maintains canonical expressions for designators under a set of equalities. Substitution is used to maintain all knowledge in terms of these canonical expressions. A partial order on designators, termed the bettername relation, is used in the choice of canonical expressions. It is shown that with an appropriate bettername relation an important engineering reasoning technique, propagation of constraints, can be implemented as a special case of this substitution process. Special purpose algebraic simplification procedures are embedded such that they interact effectively with the equality system. An electrical circuit analysis system is developed which relies upon constraint propagation and algebraic simplification as primary reasoning techniques. The reasoning is guided by a bettername relation in which referentially transparent terms are preferred to referentially opaque ones. Multiple description of subcircuits are shown to interact strongly with the reasoning mechanisms
6 editions published in 1980 in English and held by 9 WorldCat member libraries worldwide
This report describes a system which maintains canonical expressions for designators under a set of equalities. Substitution is used to maintain all knowledge in terms of these canonical expressions. A partial order on designators, termed the bettername relation, is used in the choice of canonical expressions. It is shown that with an appropriate bettername relation an important engineering reasoning technique, propagation of constraints, can be implemented as a special case of this substitution process. Special purpose algebraic simplification procedures are embedded such that they interact effectively with the equality system. An electrical circuit analysis system is developed which relies upon constraint propagation and algebraic simplification as primary reasoning techniques. The reasoning is guided by a bettername relation in which referentially transparent terms are preferred to referentially opaque ones. Multiple description of subcircuits are shown to interact strongly with the reasoning mechanisms
An outlook on truth maintenance by
David A McAllester(
Book
)
5 editions published in 1980 in English and Undetermined and held by 8 WorldCat member libraries worldwide
Truth maintenance systems (TMS) have been used in several recent problemsolving systems to record justifications for deduced assertions, to track down the assumptions which underlie contradictions when they arise, and to incrementally modify assertional data structures when assumptions are retracted. This report describes a TMS algorithm that is substantially different from previous systems. This algorithm performs deduction in traditional propositional logic in such a way that the premise set from which deduction is being done can be easily manipulated. A novel approach is also taken to the role of a TMS in larger deductive systems. In this approach the TMS performs all propositional deduction in a uniform manner while the larger system is responsible for controlling the instantiation of universally quantified formulae and axiom schemas
5 editions published in 1980 in English and Undetermined and held by 8 WorldCat member libraries worldwide
Truth maintenance systems (TMS) have been used in several recent problemsolving systems to record justifications for deduced assertions, to track down the assumptions which underlie contradictions when they arise, and to incrementally modify assertional data structures when assumptions are retracted. This report describes a TMS algorithm that is substantially different from previous systems. This algorithm performs deduction in traditional propositional logic in such a way that the premise set from which deduction is being done can be easily manipulated. A novel approach is also taken to the role of a TMS in larger deductive systems. In this approach the TMS performs all propositional deduction in a uniform manner while the larger system is responsible for controlling the instantiation of universally quantified formulae and axiom schemas
A three valued truth maintenance system by
David A McAllester(
Book
)
3 editions published in 1978 in English and held by 7 WorldCat member libraries worldwide
Truth maintenace systems have been used in recently developed problem solving systems. A truth maintenance system (TMS) is designed to be used by deductive systems to maintain the logical relations among the beliefs which those systems manipulate. These relations are used to incrementally modify the belief structure when premises are changed, giving a more flexible context mechanism than has been present in earlier artificial intelligence systems. The relations among beliefs can also be used to directly trace the source of contradictions or failures, resulting in far more efficient backtracking. In this paper a new approach is taken to truth maintenance algorithms. Each belief, or proposition, can be in any one of three truth states, true, false, or unknown. The relations among propositions are represented in disjunctive classes. By representing an implication in a clause the same algorithm that is used to deduce its consequent can be used to deduce the negation of antecedents that would lead to contradictions. A simple approach is also taken to the handling of assumptions and back tracking which does not involve the nonmonotonic dependency structures present in other truth maintenance systems. (Author)
3 editions published in 1978 in English and held by 7 WorldCat member libraries worldwide
Truth maintenace systems have been used in recently developed problem solving systems. A truth maintenance system (TMS) is designed to be used by deductive systems to maintain the logical relations among the beliefs which those systems manipulate. These relations are used to incrementally modify the belief structure when premises are changed, giving a more flexible context mechanism than has been present in earlier artificial intelligence systems. The relations among beliefs can also be used to directly trace the source of contradictions or failures, resulting in far more efficient backtracking. In this paper a new approach is taken to truth maintenance algorithms. Each belief, or proposition, can be in any one of three truth states, true, false, or unknown. The relations among propositions are represented in disjunctive classes. By representing an implication in a clause the same algorithm that is used to deduce its consequent can be used to deduce the negation of antecedents that would lead to contradictions. A simple approach is also taken to the handling of assumptions and back tracking which does not involve the nonmonotonic dependency structures present in other truth maintenance systems. (Author)
Uncertainty in artificial intelligence : proceedings of the Twentyfourth Conference (2008), July 912, 2008, Helsinki, Finland by Conference on Uncertainty in Artificial Intelligence(
Book
)
2 editions published in 2008 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 2008 in English and held by 5 WorldCat member libraries worldwide
Taxonomic syntax for first order inference by
David A McAllester(
Book
)
5 editions published in 1989 in English and held by 5 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
5 editions published in 1989 in English and held by 5 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
Solving Uninterpreted Equations with Context Free Expression Grammars by
David A McAllester(
Book
)
3 editions published in 1983 in English and held by 4 WorldCat member libraries worldwide
It is shown here that the equivalence class of an expression under the congruence closure of any finite set of equations between ground terms is a context free expression language. An expression is either a symbol or an ntuple of expressions; the difference between expressions and strings is that expressions have inherent phrase structure. The fact that context free expression languages are closed under intersection is used to derive an algorithm for computing a grammar for the equivalence class of a given expression under any finite disjunction of finite sets of equations between ground expressions. This algorithm can also be used to derive a grammar representing the equivalence class of conditional expressions of the form if P then u else v. The description of an equivalence class by a context free expression grammar can also be used to simplify expressions under 'well behaved' simplicity orders. Specifically if G is a context free expression grammar which generates an equivalence class of expressions then for any well behaved simplicity order there is a subset G' of the productions of G such that the expressions generated by G' are exactly those expressions of the equivalence class which are simplicity bounds and whose subterms are also simplicity bounds. Furthermore G' can be computed from G in order nlog(n) time plus the time required to do order nlog(n) comparisons between expressions where n is the size G
3 editions published in 1983 in English and held by 4 WorldCat member libraries worldwide
It is shown here that the equivalence class of an expression under the congruence closure of any finite set of equations between ground terms is a context free expression language. An expression is either a symbol or an ntuple of expressions; the difference between expressions and strings is that expressions have inherent phrase structure. The fact that context free expression languages are closed under intersection is used to derive an algorithm for computing a grammar for the equivalence class of a given expression under any finite disjunction of finite sets of equations between ground expressions. This algorithm can also be used to derive a grammar representing the equivalence class of conditional expressions of the form if P then u else v. The description of an equivalence class by a context free expression grammar can also be used to simplify expressions under 'well behaved' simplicity orders. Specifically if G is a context free expression grammar which generates an equivalence class of expressions then for any well behaved simplicity order there is a subset G' of the productions of G such that the expressions generated by G' are exactly those expressions of the equivalence class which are simplicity bounds and whose subterms are also simplicity bounds. Furthermore G' can be computed from G in order nlog(n) time plus the time required to do order nlog(n) comparisons between expressions where n is the size G
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)
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)
Lifting transformations by
David A McAllester(
Book
)
2 editions published in 1991 in English and held by 4 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."
2 editions published in 1991 in English and held by 4 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."
Nonexpressibility of fairness and signaling by
David A McAllester(
Book
)
3 editions published in 1989 in English and held by 4 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."
3 editions published in 1989 in English and held by 4 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."
Symmetric Set Theory, a General Theory of Isomorphism, Abstraction, and Representation by
David A McAllester(
Book
)
3 editions published in 1983 in English and held by 4 WorldCat member libraries worldwide
It is possible to represent a finite set of points (atoms) by a finite sequence of points. However a finite set of points has no distinguished member and therefore it is impossible to define a function which takes a finite set of points and returns a first point in that set. Thus it is impossible to represent a finite sequence of points by a finite set of points. The theory of symmetric sets provides a framework in which this observation about sets and sequences can be proven. The theory of symmetric sets is similar to classical (ZermelloFraenkel) set theory with the exception that the universe of symmetric sets includes points (urelements). Points provide a basis for general notions of isomorphism and symmetry. The general notions of isomorphism and symmetry in turn provide a basis for natural, simple, and universal defintions of abstractness, essential properties and functions, canonicality, and representations. It is expected that these notions will play an important role in the theory of data structures and in the construction of general techniques for reasoning about data structures. (Author)
3 editions published in 1983 in English and held by 4 WorldCat member libraries worldwide
It is possible to represent a finite set of points (atoms) by a finite sequence of points. However a finite set of points has no distinguished member and therefore it is impossible to define a function which takes a finite set of points and returns a first point in that set. Thus it is impossible to represent a finite sequence of points by a finite set of points. The theory of symmetric sets provides a framework in which this observation about sets and sequences can be proven. The theory of symmetric sets is similar to classical (ZermelloFraenkel) set theory with the exception that the universe of symmetric sets includes points (urelements). Points provide a basis for general notions of isomorphism and symmetry. The general notions of isomorphism and symmetry in turn provide a basis for natural, simple, and universal defintions of abstractness, essential properties and functions, canonicality, and representations. It is expected that these notions will play an important role in the theory of data structures and in the construction of general techniques for reasoning about data structures. (Author)
Reasoning Utility Package User's Manual. Version One by
David A McAllester(
Book
)
4 editions published in 1982 in English and held by 4 WorldCat member libraries worldwide
RUP (Reasoning Utility Package) is a collection of procedures for performing various computations relevant to automated reasoning. RUP contains a truth maintenance system (TMS) which can be used to perform simple propositional deduction (unit clause resolution), to record justifications, to track down underlying assumptions, and to perform incremental modifications when premises are changed. This TMS can be used with an automatic premise controller which automatically retracts 'assumptions' before 'solid facts' when contradictions arise and searches for the most solid proof of an assertion. RUP also contains a procedure for efficiently computing all the relevant consequences of any set of equalities between ground terms. A related utility computes 'substitution simplifications' of terms under an arbitrary set of unquantified equalities and a user defined simplicity order. RUP also contains demon writing macros which allow one to write PLANNER like demons that trigger on various types of events in the data base. Finally there is a utility for reasoning about partial orders and arbitrary transitive relations. In writing all of these utilities an attempt has been made to provide a maximally flexible environment for automated reasoning. (Author)
4 editions published in 1982 in English and held by 4 WorldCat member libraries worldwide
RUP (Reasoning Utility Package) is a collection of procedures for performing various computations relevant to automated reasoning. RUP contains a truth maintenance system (TMS) which can be used to perform simple propositional deduction (unit clause resolution), to record justifications, to track down underlying assumptions, and to perform incremental modifications when premises are changed. This TMS can be used with an automatic premise controller which automatically retracts 'assumptions' before 'solid facts' when contradictions arise and searches for the most solid proof of an assertion. RUP also contains a procedure for efficiently computing all the relevant consequences of any set of equalities between ground terms. A related utility computes 'substitution simplifications' of terms under an arbitrary set of unquantified equalities and a user defined simplicity order. RUP also contains demon writing macros which allow one to write PLANNER like demons that trigger on various types of events in the data base. Finally there is a utility for reasoning about partial orders and arbitrary transitive relations. In writing all of these utilities an attempt has been made to provide a maximally flexible environment for automated reasoning. (Author)
Natural language based inference procedures applied to Schubert's steamroller by Robert Givan(
Book
)
2 editions published in 1991 in English and held by 4 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."
2 editions published in 1991 in English and held by 4 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."
Uncertainty in artificial intelligence : proceedings of the Twentyfifth Conference (2009), June 1821, 2009, Montreal, Quebec by Conference on Uncertainty in Artificial Intelligence(
Book
)
2 editions published in 2009 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 2009 in English and held by 4 WorldCat member libraries worldwide
Grammar rewriting by
David A McAllester(
Book
)
2 editions 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
2 editions 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
Observations on cognitive judgments by
David A McAllester(
Book
)
2 editions 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."
2 editions 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."
Systematic nonlinear planning by
David A McAllester(
Book
)
2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide
Systematicity is achieved through a simple modification of Tate's procedure."
2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide
Systematicity is achieved through a simple modification of Tate's procedure."
Tractable inference relations by Robert Givan(
Book
)
2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We consider the concept of local sets of inference rules. Locality is a syntactic condition on rule sets which guarantees that the inference relation defined by those rules is polynomial time decidable. Unfortunately, determining whether a given rule set is local can be difficult. In this paper we define inductive locality, a strengthening of locality. We also give a procedure which can automatically recognize the locality of any inductively local rule set. Inductive locality seems to be more useful that [sic] the earlier concept of strong locality. There are many natural examples of inductively local rule sets that are not strongly local
2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We consider the concept of local sets of inference rules. Locality is a syntactic condition on rule sets which guarantees that the inference relation defined by those rules is polynomial time decidable. Unfortunately, determining whether a given rule set is local can be difficult. In this paper we define inductive locality, a strengthening of locality. We also give a procedure which can automatically recognize the locality of any inductively local rule set. Inductive locality seems to be more useful that [sic] the earlier concept of strong locality. There are many natural examples of inductively local rule sets that are not strongly local
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Voronkov, Andrei 1959 Editor
 Ganzinger, H. (Harald) 1950 Author Editor
 Massachusetts Institute of Technology Artificial Intelligence Laboratory
 CADE (International Conference on Automated Deduction, 17, 2000, Pittsburgh, Pa.)
 MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB
 Givan, Robert Author
 CADE 2000 Pittsburgh, Pa
 Association for Uncertainty in Artificial Intelligence
 Parr, Ronald
 Dasgupta, Sanjoy Editor
Useful Links
Associated Subjects
Algorithms Artificial intelligence Automatic theorem proving Cognitive science Computational linguistics Computer logic Computer networks Computer science Constraints (Physics) Electronic circuits 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 ReasoningComputer programs Rewriting systems (Computer science) Set theory Truth maintenance systems Uncertainty (Information theory)
Alternative Names
David A. McAllester American academic
David A. McAllester Amerikaans ingenieur
Mac Allester, David
MacAllester, David
MacAllester, David A.
Mc Allester, David
McAllester, David
McAllester, David A.
Languages
Covers