Results 1  10
of
42
Truth Maintenance
, 1990
"... General purpose truth maintenance systems have received considerable attention in the past few years. This paper discusses the functionality of truth maintenance systems and compares various existing algorithms. Applications and directions for future research are also discussed. Introduction In 197 ..."
Abstract

Cited by 110 (3 self)
 Add to MetaCart
General purpose truth maintenance systems have received considerable attention in the past few years. This paper discusses the functionality of truth maintenance systems and compares various existing algorithms. Applications and directions for future research are also discussed. Introduction In 1978 Jon Doyle wrote a masters thesis at the MIT AI Laboratory entitled "Truth Maintenance Systems for Problem Solving" [ Doyle, 1979 ] . In this thesis Doyle described an independent module called a truth maintenance system, or TMS, which maintained beliefs for general problem solving systems. In the twelve years since the appearance of Doyle's TMS a large body of literature has accumulated on truth maintenance. The seminal idea appears not to have been any particular technical mechanism but rather the general concept of an independent module for truth (or belief) maintenance. All truth maintenance systems manipulate proposition symbols and relationships between proposition symbols. I will use...
Probabilistic argumentation systems
 Handbook of Defeasible Reasoning and Uncertainty Management Systems, Volume 5: Algorithms for Uncertainty and Defeasible Reasoning
, 2000
"... Different formalisms for solving problems of inference under uncertainty have been developed so far. The most popular numerical approach is the theory of Bayesian inference [42]. More general approaches are the DempsterShafer theory of evidence [51], and possibility theory [16], which is closely re ..."
Abstract

Cited by 53 (33 self)
 Add to MetaCart
Different formalisms for solving problems of inference under uncertainty have been developed so far. The most popular numerical approach is the theory of Bayesian inference [42]. More general approaches are the DempsterShafer theory of evidence [51], and possibility theory [16], which is closely related to fuzzy systems.
Dialectical Argumentation to Solve Conflicts in Advice Giving: A Case Study in the Promotion of Healthy Nutrition
, 2000
"... This paper presents a formalization of a theory of informal argumentation, focused on techniques to change attitudes of the interlocutor, in the domain of health promotion ..."
Abstract

Cited by 43 (8 self)
 Add to MetaCart
This paper presents a formalization of a theory of informal argumentation, focused on techniques to change attitudes of the interlocutor, in the domain of health promotion
Query Answering in Information Systems with Integrity Constraints
, 1997
"... The specifications of most of the nowadays ubiquitous informations systems include integrity constraints, i.e. conditions rejecting socalled "invalid" or "inconsistent " data. Information system consistency and query answering have been formalized referring to classical logic implicitly assuming th ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
The specifications of most of the nowadays ubiquitous informations systems include integrity constraints, i.e. conditions rejecting socalled "invalid" or "inconsistent " data. Information system consistency and query answering have been formalized referring to classical logic implicitly assuming that query answering only makes sense with consistent information systems. In practice, however, inconsistent as well as consistent information systems need to be queried. In this paper, it is first argued that classical logic is inappropriate for a formalization of information systems because of its global notion of inconsistency. It is claimed that information systems inconsistency should be understood as a local notion. Then, it is shown that minimal logic, a constructivistic weakening of classical logic which precludes refutation proofs, provides for local inconsistencies that conveniently reflect a practitioner's intuition. Further, minimal logic is shown to be a convenient foundation fo...
Computation in Valuation Algebras
 IN HANDBOOK OF DEFEASIBLE REASONING AND UNCERTAINTY MANAGEMENT SYSTEMS, VOLUME 5: ALGORITHMS FOR UNCERTAINTY AND DEFEASIBLE REASONING
, 1999
"... Many different formalisms for treating uncertainty or, more generally, information and knowledge, have a common underlying algebraic structure. ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
Many different formalisms for treating uncertainty or, more generally, information and knowledge, have a common underlying algebraic structure.
A Qualitative Approach to Rigid Body Mechanics
, 1988
"... In order for a program to interact with the world as well as people do, we must provide it with a great deal of commonsense about the way things work. Reasoning 'about the geometric interactions ad motions of objects is an important part of that commons.ns.. Some of the most complex problems we solv ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
In order for a program to interact with the world as well as people do, we must provide it with a great deal of commonsense about the way things work. Reasoning 'about the geometric interactions ad motions of objects is an important part of that commons.ns.. Some of the most complex problems we solve involve reasoning about mechanical devices, such as gears, cams, and docks. Qualitative mechanics is the symbolic analysis of the motions and the geometric in terations of physical objects. This thesis describes a theory for analysis of rigid body mechanisms, an important subset of qualitative mechanics problems. This theory has been implemented ad tested on several mechanisms including a mechanical clock. Beginning with drawings of the parts involved we compute a discrete symbolic description showing changes in position and motion of the parts of the mechanism as well as its global behavior.
Costbounded argumentation
 International Journal of Approximate Reasoning
"... The purpose of this paper is to present new computational techniques for probabilistic argumentation systems. It shows that instead of computing intractable large sets of arguments, it is also possible to find good approximations of the exact solutions in reasonable time. The technique presented is ..."
Abstract

Cited by 20 (13 self)
 Add to MetaCart
The purpose of this paper is to present new computational techniques for probabilistic argumentation systems. It shows that instead of computing intractable large sets of arguments, it is also possible to find good approximations of the exact solutions in reasonable time. The technique presented is based on cost functions, which are used to measure the relevance of arguments.
Probabilistic AssumptionBased Reasoning
 PROC. 9TH CONF. ON UNCERTAINTY IN ARTIFICIAL INTELLIGENCE
, 1993
"... In this paper the classical propositional assumptionbased model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of the DempsterShafer theory of evidence. Laskey, Lehner [1] and Provan [2] have already proposed a similar point of view ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
In this paper the classical propositional assumptionbased model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of the DempsterShafer theory of evidence. Laskey, Lehner [1] and Provan [2] have already proposed a similar point of view but these papers do not emphasize the mathematical foundations of the probabilistic assumptionbased reasoning paradigm. These foundations are thoroughly exposed in the rst part of this paper. Then we address the computational problems related to the assumptionbased model. The idea is to translate evidence theory problems into propositional logic problems and then use the powerful techniques of logic to solve them. In particular, advanced consequence nding algorithms developed by Inoue [3] and Siegel [4] will be used. These logicbased techniques can be considered as alternatives to the classical method of local propagation in Markov trees. Finally, we switch back from logic to the theory of evidence in order to compute degrees of support of hypotheses. We show that some recently proposed methods for computing simple disjunctive normal forms can be used to compute these degrees of support.
Massively parallel assumptionbased truth maintenance
 In Nonmonotonic reasoning
, 1988
"... De Kleer’s Assumptionbased Truth Maintenance System (ATMS) is a propositional inference engine designed to simplify the construction of problem solvers that search complex search spaces efficiently. The ATMS has become a key component of many problem solvers, and often the primary consumer of comp ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
De Kleer’s Assumptionbased Truth Maintenance System (ATMS) is a propositional inference engine designed to simplify the construction of problem solvers that search complex search spaces efficiently. The ATMS has become a key component of many problem solvers, and often the primary consumer of computational resources. Although considerable effort has gone into designing and optimizing the LisP implementation, it now appears to be approaching the performance limitations of serial architectures, In this paper we show how the combination of a conventional serial machine and a massively parallel processor can dramatically speed up the ATMS algorithms, providing a very powerful general purpose architecture for problem solving.