A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Possibilistic Safe Beliefs vs. Possibilistic Stable Models
2012
Research in Computing Science
Preserved Fulltext
In this paper we show an application of possibilistic stable models to a learning situation. ...
Our main result is that possibilistic stable models of possibilistic normal programs are also possibilistic safe beliefs of such programs. ...
M is a possibilistic safe belief of P, but not a possibilistic stable model of P. ...
doi:10.13053/rcs-56-1-5
fatcat:ezml4jsolzdtxd2ktj7bhjvzha
Possibilistic Stable Models
2005
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In a second part, we define what is a possibilistic stable model for a normal logic program, with default negation. ...
Again, we define a possibility distribution allowing to determine the stable models. ...
Let A be a possibilistic stable model of P , then A * is a stable model of P * . ...
doi:10.4230/dagsemproc.05171.6
fatcat:7g33ibxffvdm3pviazo4brx7qu
Possibilistic uncertainty handling for answer set programming
2006
Annals of Mathematics and Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
By means of a possibility distribution we define a clear semantics of such programs by introducing what is a possibilistic stable model. ...
Furthermore, we explain how we can compute possibilistic stable models by using available softwares for Answer Set Programming and we describe the main lines of the system that we have developed to achieve ...
Let A be a possibilistic stable model of P, then A * is a stable model of P * . ...
doi:10.1007/s10472-006-9029-y
fatcat:schtv2wkfbe77mo5gmfohpr4qe
A Possibilistic Inconsistency Handling in Answer Set Programming
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. ...
Possibilistic logic is a logic of uncertainty able to deal with inconsistency in classical logic. ...
., S is a possibilistic stable model of P if and only if S = ΠM(P S * ). ...
doi:10.1007/11518655_35
fatcat:dhosiesbtbhg3kxe4dqkfrse3i
Semantics for Possibilistic Disjunctive Programs
2011
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In order to manage inconsistent possibilistic logic programs, a preference criterion between inconsistent possibilistic models is defined. ...
AbstractIn this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete, and inconsistent information is defined. ...
In fact, P 1 has no possibilistic stable model neither possibilistic answer set. ...
doi:10.1017/s1471068411000408
fatcat:d6be4dfdxvfgrjmssuyq34uhre
Semantics for Possibilistic Disjunctive Programs
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete and inconsistent information is defined. ...
In order to manage inconsistent possibilistic logic programs, a preference criterion between inconsistent possibilistic models is defined; in addition, the approach of cuts for restoring consistency of ...
M is a possibilistic answer set of P if and only if M is a possibilistic stable model of P . ...
arXiv:1106.0776v1
fatcat:wgqq36wrtbcutib2s5ssnqtj6e
Possibilistic Stratified Minimal Model Semantics
2009
2009 Mexican International Conference on Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce a recursive construction of a possibilistic logic programming semantics that we call Possibilistic Stratified Minimal Model Semantics. ...
One of the main implications of satisfying relevance by this semantics is that it will allow performing top-down queries from a possibilistic knowledge base. ...
possibilistic p-stable semantics [27] , one is able to construct different possibilistic semantics which will satisfy the property of relevance. ...
doi:10.1109/enc.2009.14
dblp:conf/enc/NievesO09
fatcat:atxi2c6m2bbfln256ur2nhn65a
Possibilistic-Based Argumentation: An Answer Set Programming Approach
2008
2008 Mexican International Conference on Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We present a possibilistic-based argumentation approach which is based on a possibilistic disjunctive language. ...
s approach is based on the concept of possibilistic stable model which defines a semantics for possibilistic normal logic programs. Following Nicolas et al.' ...
For instance, by applying the original definition [23] to P , the only stable model is: {a, ¬a, b, ¬b}. The DLV system [14] returns no models if the program is inconsistent. ...
doi:10.1109/enc.2008.37
dblp:conf/enc/NievesCO08
fatcat:fvvkklf7irgtnohzy4jdchajm4
Possibilistic Well-Founded Semantics
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This means that given a possibilistic logic program one can infer a set of possibilistic models. ...
However, sometimes it is desirable to associate just one possibilistic model to a given possibilistic logic program. ...
program P and P oss_P stable(P ) denotes a function which returns the set of possibilistic pstable models [13] of a possibilistic logic program P . ...
doi:10.1007/978-3-642-05258-3_2
fatcat:3fdtwr635jbhhopssh37257c5q
Conditions générales pour l'admissibilité de la programmation dynamique dans la décision séquentielle possibiliste
2007
Revue d'intelligence artificielle : Revue des Sciences et Technologies de l'Information
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Like in the standard model, three preference relations can be distinguished (preferences over paths, over lotteries and over policies). ...
Nous nous intéressons à la contrepartie possibiliste des processus de décision markoviens. ...
Il inclurait par exemple le modèle des PDM possibilistes multicritères (non encore étudié). ...
doi:10.3166/ria.21.129-143
fatcat:lqtj2i355ffejpfr77mllc3wvy
A Brief Comparative Study of Uncertainty Modeling Techniques in Power System
2020
2020 IEEE 23rd International Multitopic Conference (INMIC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
It will also help outline the needs and requirements of novel models for uncertainty modeling in energy systems. ...
Since power generation from these resources is intermittent due to uncertain climate conditions, therefore their rising integration poses several challenges for power system engineers to ensure stable ...
POSSIBILISTIC METHOD The idea of uncertainty modeling through the possibilistic approach was given by [9] . ...
doi:10.1109/inmic50486.2020.9318090
fatcat:w36ozczjhrbo3h2a6q2t5eqin4
Characterizing and extending answer set semantics using possibility theory
2014
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Special models of these constraints are then identified as possibilistic answer sets. ...
Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. ...
As rules are essentially modelled using material implication, however, the stable model semantics cannot straightforwardly be characterized using possibilistic logic programming. ...
doi:10.1017/s147106841300063x
fatcat:qi6sp2bwgveqzopi7ovxzagr7q
Weak and Strong Disjunction in Possibilistic ASP
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
While PASP has been well-studied for possibilistic definite and possibilistic normal programs, we argue that the current semantics of possibilistic disjunctive programs are not entirely satisfactory. ...
Possibilistic answer set programming (PASP) unites answer set programming (ASP) and possibilistic logic (PL) by associating certainty values with rules. ...
Yet these models are closer to the intuition of classical models than they are to the intuition of stable models as used in ASP. ...
doi:10.1007/978-3-642-23963-2_37
fatcat:jrscnavmqzbu7lcbec3nhuo26q
Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
models of a possibilistic ordered disjunction programs. ...
We compare the possibilistic pstable semantics for ordered disjunction programs with the recently defined possibilistic answer set semantics for the same class of logic programs. ...
We want to show how, under pstable semantics, its possibilistic stable models are M 1 = {(a, 0.8)} and M 2 = {(b, 0.8)} while, under answer set semantics, its possibilistic answer sets are M 1 = {(a, 0.3 ...
doi:10.1007/978-3-642-10291-2_6
fatcat:2ajr2kyxtjb4pebwyrqitngyry
Possibilistic Answer Set Programming Revisited
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. ...
To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP programs in terms of possibilistic logic where an ASP program specifies a set of constraints ...
However, pstable models (Osorio et al., 2006) are closer to classical models than they are to stable models, i.e. answer sets. ...
arXiv:1203.3466v1
fatcat:djswyskstfbgrj6esaplg4erxm
« Previous
Showing results 1 — 15 out of 1,176 results