Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
229
Timed Possibilistic Logic
- Handbook of logic in Artificial Intelligence and logic programming
, 1991
"... . This paper is an attempt to cast both uncertainty and time in a logical framework. It generalizes possibilistic logic, previously developed by the authors, where each classical formula is associated with a weight which obeys the laws of possibility theory. In the possibilistic temporal logic we pr ..."
Abstract
-
Cited by 16 (3 self)
- Add to MetaCart
. This paper is an attempt to cast both uncertainty and time in a logical framework. It generalizes possibilistic logic, previously developed by the authors, where each classical formula is associated with a weight which obeys the laws of possibility theory. In the possibilistic temporal logic we
Possibilistic Logic as an Annotated Logic
"... In this paper we study how to transform possibilistic logic extended with fuzzy constants and fuzzy quantifiers into the generalized annotated logic system proposed by Kifer and Subrahmanian in 1992. Specifically, the valuation in a possibilistic clause generates the annotation which will be attache ..."
Abstract
- Add to MetaCart
In this paper we study how to transform possibilistic logic extended with fuzzy constants and fuzzy quantifiers into the generalized annotated logic system proposed by Kifer and Subrahmanian in 1992. Specifically, the valuation in a possibilistic clause generates the annotation which
Possibilistic Logic: Complexity and Algorithms
, 1997
"... Possibilistic logic is a logic for reasoning with uncertain and partially inconsistent knowledge bases. Its standard version consists in ranking propositional formulas according to their certainty or priority level, by assigning them lower bounds of necessity values. We give a survey of automated de ..."
Abstract
-
Cited by 31 (0 self)
- Add to MetaCart
Possibilistic logic is a logic for reasoning with uncertain and partially inconsistent knowledge bases. Its standard version consists in ranking propositional formulas according to their certainty or priority level, by assigning them lower bounds of necessity values. We give a survey of automated
Interval-Based Possibilistic Logic
- PROCEEDINGS OF THE TWENTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
"... Possibilistic logic is a well-known framework for dealing with uncertainty and reasoning under inconsistent knowledge bases. Standard possibilistic logic expressions are propositional logic formulas associated with positive real degrees belonging to [0,1]. However, in practice it may be difficult fo ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
Possibilistic logic is a well-known framework for dealing with uncertainty and reasoning under inconsistent knowledge bases. Standard possibilistic logic expressions are propositional logic formulas associated with positive real degrees belonging to [0,1]. However, in practice it may be difficult
Possibilistic Logic Framework
"... In many applications, the reliability relation associated with available information is only partially defined, while most of existing uncertainty frameworks deal with totally ordered pieces of knowledge. Partial pre-orders offer more flexibility than total pre-orders to represent incomplete knowled ..."
Abstract
- Add to MetaCart
knowledge. Possibilistic logic, which is an extension of classical logic, deals with totally ordered information. It offers a natural qualitative framework for handling uncertain information. Priorities are encoded by means of weighted formulas, where weights are lower bounds of necessity measures
From Partial to Possibilistic Logic
"... Abstract. Based on our earlier work on partial logics and extended logic programs [Wag91, Wag94, HJW96], and on the possibilistic logic of [DLP94], we de ne a compositional possibilistic rst-order logic with two kinds of negation. 1 ..."
Abstract
- Add to MetaCart
Abstract. Based on our earlier work on partial logics and extended logic programs [Wag91, Wag94, HJW96], and on the possibilistic logic of [DLP94], we de ne a compositional possibilistic rst-order logic with two kinds of negation. 1
An algebraic semantics for possibilistic logic
- Uncertainty in Artificial Intelligence (UAI 95
, 1995
"... The first contribution of this paper is the presentation of a Pavelka–like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (¬) and a new type of conjunction (⊗). The space of truth values for this logic is the lattice of poss ..."
Abstract
-
Cited by 15 (9 self)
- Add to MetaCart
The first contribution of this paper is the presentation of a Pavelka–like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (¬) and a new type of conjunction (⊗). The space of truth values for this logic is the lattice
Possibilistic logic 1
"... Possibilistic logic is a logic of uncertainty tailored for reasoning under incomplete evidence and partially inconsistent knowledge. At the syntactic level it handles formulas of propositional or first-order logic to which are attached numbers between 0 and 1, or more generally elements in a totally ..."
Abstract
- Add to MetaCart
Possibilistic logic is a logic of uncertainty tailored for reasoning under incomplete evidence and partially inconsistent knowledge. At the syntactic level it handles formulas of propositional or first-order logic to which are attached numbers between 0 and 1, or more generally elements in a
Representing Default Rules in Possibilistic Logic
, 1992
"... A key issue when reasoning with default rules is how to order them so as to derive plausible conclusions according to the more specific rules applicable to the situation under concern, to make sure that default rules are not systematically inhibited by more general rules, and to cope with the proble ..."
Abstract
-
Cited by 105 (42 self)
- Add to MetaCart
with the problem of irrelevance of facts with respect to exceptions. Pearl's system Z enables us to rank-order default rules. In this paper we show how to encode such a rank-ordered set of defaults in possibilistic logic. We can thus take advantage of the deductive machinery available in possibilistic logic
Results 1 - 10
of
229
