Results 1  10
of
1,099,892
An assumptionbased truthmaintenance system
 Artificial Intelligence
, 1986
"... In this paper we (1) define the concept of a Clause Managetnent System (CMS) — a generaizatiou of de Kleer’s ATMS, (2) motivate such systems in terms of efficiency of search and abductive reasoning, and (3) characterize the computation affected by a CMS in terms of the concept of prime implicants. ..."
Abstract

Cited by 336 (9 self)
 Add to MetaCart
In this paper we (1) define the concept of a Clause Managetnent System (CMS) — a generaizatiou of de Kleer’s ATMS, (2) motivate such systems in terms of efficiency of search and abductive reasoning, and (3) characterize the computation affected by a CMS in terms of the concept of prime implicants
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 (6 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
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics
, 1990
"... Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always been described only negatively, by the property it does not enjoy, i.e. monotonicity. We study here general patterns of ..."
Abstract

Cited by 624 (14 self)
 Add to MetaCart
Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always been described only negatively, by the property it does not enjoy, i.e. monotonicity. We study here general patterns
An AssumptionBased Framework for NonMonotonic Reasoning
 Proc. 2nd International Workshop on Logic Programming and Nonmonotonic Reasoning
, 1993
"... The notion of assumptionbased framework generalises and refines the use of abduction to give a formalisation of nonmonotonic reasoning. In this framework, a sentence is a nonmonotonic consequence of a theory if it can be derived monotonically from a theory extended by means of acceptable assumpti ..."
Abstract

Cited by 71 (15 self)
 Add to MetaCart
The notion of assumptionbased framework generalises and refines the use of abduction to give a formalisation of nonmonotonic reasoning. In this framework, a sentence is a nonmonotonic consequence of a theory if it can be derived monotonically from a theory extended by means of acceptable
The empirical case for two systems of reasoning
, 1996
"... Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations ref ..."
Abstract

Cited by 631 (4 self)
 Add to MetaCart
and can simultaneously generate different solutions to a reasoning problem. The rulebased system can suppress the associative system but not completely inhibit it. The article reviews evidence in favor of the distinction and its characterization.
Assumptionbased Reasoning of Intelligent Agents
 in: Proceedings of Conference od Control Systems and Computer Science
, 1997
"... The paper presents a society of nonmonotonic reasoning agents and shows how this approach deals with interagent communications by providing a framework for the change of mental states of the agents participating in the performance of speech acts. The nonmonotonic default approach accounts for the a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The paper presents a society of nonmonotonic reasoning agents and shows how this approach deals with interagent communications by providing a framework for the change of mental states of the agents participating in the performance of speech acts. The nonmonotonic default approach accounts
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
Ptolemy: A Framework for Simulating and Prototyping Heterogeneous Systems
, 1992
"... Ptolemy is an environment for simulation and prototyping of heterogeneous systems. It uses modern objectoriented software technology (C++) to model each subsystem in a natural and efficient manner, and to integrate these subsystems into a whole. Ptolemy encompasses practically all aspects of design ..."
Abstract

Cited by 569 (90 self)
 Add to MetaCart
. The core of Ptolemy is a set of objectoriented class definitions that makes few assumptions about the system to be modeled; rather, standard interfaces are provided for generic objects and more specialized, applicationspecific objects are derived from these. A basic abstraction in Ptolemy is the Domain
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 455 (100 self)
 Add to MetaCart
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely
Results 1  10
of
1,099,892