Filters








811 Hits in 3.2 sec

Possible and Necessary Answer Sets of Possibilistic Answer Set Programs

K. Bauters, S. Schockaert, M. De Cock, D. Vermeir
2012 2012 IEEE 24th International Conference on Tools with Artificial Intelligence  
An answer set is then necessary when it is an answer set of the complete program and when it remains an answer set of all the subprograms from which we have removed uncertain rules.  ...  In Section II we provide the reader with some notions from answer set programming, possibility theory and possibilistic answer set programming.  ... 
doi:10.1109/ictai.2012.117 dblp:conf/ictai/BautersSCV12 fatcat:fhac7wm5zfey5nqeir3zziazju

Semantics for Possibilistic Disjunctive Programs

JUAN CARLOS NIEVES, MAURICIO OSORIO, ULISES CORTÉS
2011 Theory and Practice of Logic Programming  
By considering a possibilistic logic program as a possibilistic logic theory, a construction of a possibilistic logic programming semantic based on answer sets and the proof theory of possibilistic logic  ...  This approach introduces the use of possibilistic disjunctive clauses, which are able to capture incomplete information and states of a knowledge base at the same time.  ...  Inconsistency degrees of possibilistic sets For managing inconsistent possibilistic answer set, it is necessary to define a criterion of preference between possibilistic answer sets.  ... 
doi:10.1017/s1471068411000408 fatcat:d6be4dfdxvfgrjmssuyq34uhre

Semantics for Possibilistic Disjunctive Programs [article]

Juan Carlos Nieves, Mauricio Osorio, Ulises Cortés
2011 arXiv   pre-print
By considering a possibilistic logic program as a possibilistic logic theory, a construction of a possibilistic logic programming semantic based on answer sets and the proof theory of possibilistic logic  ...  In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete and inconsistent information is defined.  ...  Inconsistency degrees of possibilistic sets To manage inconsistent possibilistic answer sets, it is necessary to define a criterion of preference between possibilistic answer sets.  ... 
arXiv:1106.0776v1 fatcat:wgqq36wrtbcutib2s5ssnqtj6e

Weak and Strong Disjunction in Possibilistic ASP [chapter]

Kim Bauters, Steven Schockaert, Martine De Cock, Dirk Vermeir
2011 Lecture Notes in Computer Science  
Possibilistic answer set programming (PASP) unites answer set programming (ASP) and possibilistic logic (PL) by associating certainty values with rules.  ...  Extending our earlier work, we interpret such programs as sets of constraints on possibility distributions, whose least specific solutions correspond to answer sets.  ...  If V is a possibilistic answer set of P and ∀a ∈ B P · V (a) ∈ 0, 1, then M = {a | V (a) = 1, a ∈ B P } is an answer set of the disjunctive program P .  ... 
doi:10.1007/978-3-642-23963-2_37 fatcat:jrscnavmqzbu7lcbec3nhuo26q

Dealing with explicit preferences and uncertainty in answer set programming

Roberto Confalonieri, Juan Carlos Nieves, Mauricio Osorio, Javier Vázquez-Salceda
2012 Annals of Mathematics and Artificial Intelligence  
In this paper, we show how the formalism of Logic Programs with Ordered Disjunction (LPODs) and Possibilistic Answer Set Programming (PASP) can be merged into the single framework of Logic Programs with  ...  As a result, preferences and uncertainty can be used to select the preferred uncertain default rules of an LPPODs and, consequently, to order its possibilistic answer sets.  ...  reduction P M × , it is possible to give a characterization of a possibilistic answer set of an LPPOD in terms of the possibility distribution for possibilistic definite logic programs.  ... 
doi:10.1007/s10472-012-9311-0 fatcat:c54szncy5re2jp65tokbft37tu

Possibilistic ASP Base Revision by Certain Input

Laurent Garcia, Claire Lefèvre, Odile Papini, Igor Stéphan, Eric Würbel
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
We go a step further by introducing uncertainty and studying belief base revision when beliefs are represented by possibilistic logic programs under possibilistic answer set semantics and revised by certain  ...  Belief base revision has been studied within the answer set programming framework.  ...  Note that there is a one to one correspondence between the possibilistic answer sets of a possibilistic program P and the answer sets of its projection P * .  ... 
doi:10.24963/ijcai.2018/252 dblp:conf/ijcai/GarciaLPSW18 fatcat:a6ohn6jljrb3dkfnslsqoh4ori

Possibilistic-Based Argumentation: An Answer Set Programming Approach

Juan Carlos Nieves, Ulises Cortés, Mauricio Osorio
2008 2008 Mexican International Conference on Computer Science  
This specification language is able to capture incomplete information and incomplete states of a knowledge base at the same time.  ...  We present a possibilistic-based argumentation approach which is based on a possibilistic disjunctive language.  ...  Cortés would like to acknowledge support from the EC funded project SHARE-it: Supported Human Autonomy for Recovery and Enhancement of cognitive and motor abilities using information technologies (FP6-  ... 
doi:10.1109/enc.2008.37 dblp:conf/enc/NievesCO08 fatcat:fvvkklf7irgtnohzy4jdchajm4

Characterizing and extending answer set semantics using possibility theory

KIM BAUTERS, STEVEN SCHOCKAERT, MARTINE DE COCK, DIRK VERMEIR
2014 Theory and Practice of Logic Programming  
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.  ...  A valuation V is said to be the answer set of a possibilistic simple program if V = P ⋆ and V is consistent. Answer sets of possibilistic normal programs are defined using a reduct.  ... 
doi:10.1017/s147106841300063x fatcat:qi6sp2bwgveqzopi7ovxzagr7q

Semantics for possibilistic answer set programs: Uncertain rules versus rules with uncertain conclusions

Kim Bauters, Steven Schockaert, Martine De Cock, Dirk Vermeir
2014 International Journal of Approximate Reasoning  
The first view gives rise to a set of weighted answer sets, whereas the second view gives rise to a weighted set of classical answer sets.  ...  Although Answer Set Programming (ASP) is a powerful framework for declarative problem solving, it cannot in an intuitive way handle situations in which some rules are uncertain, or in which it is more  ...  In Section 2 we provide the reader with some important notions from answer set programming, possibilistic logic and current work on possibilistic answer set programs, in which weights refer to the certainty  ... 
doi:10.1016/j.ijar.2013.09.006 fatcat:iyuqti3g4zbydickv736cdk43q

Rules and meta-rules in the framework of possibility theory and possibilistic logic

D. Dubois, H. Prade, S. Schockaert
2011 Scientia Iranica. International Journal of Science and Technology  
, as in possibilistic answer set programming.  ...  Starting from the expression of different forms of fuzzy rules that have been identified in the setting of possibility theory, we study their counterparts in the extensions of possibilistic logic.  ...  Let P be an answer set program without negation, and let K P be its translation in generalized possibilistic logic, as described above. Let A be the unique answer set of P.  ... 
doi:10.1016/j.scient.2011.04.008 fatcat:dtptwlqa2bhkbbyhug4tiqgtoa

A Possibilistic Inconsistency Handling in Answer Set Programming [chapter]

Pascal Nicolas, Laurent Garcia, Igor Stéphan
2005 Lecture Notes in Computer Science  
Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model.  ...  In this work, we address the treatment of inconsistency in Answer Set Programming by a possibilistic approach that takes into account the non monotonic aspect of the framework.  ...  When there is no answer set, the program is said to be inconsistent and it is not possible to reason with it. But, as far as we know, there is no work in ASP that deals with inconsistent programs.  ... 
doi:10.1007/11518655_35 fatcat:dhosiesbtbhg3kxe4dqkfrse3i

The PITA system: Tabling and answer subsumption for reasoning under uncertainty

FABRIZIO RIGUZZI, TERRANCE SWIFT
2011 Theory and Practice of Logic Programming  
As an entirely different alternative, Possibilistic Logic Programs adopt a simpler metric of uncertainty than probability.Each of these approaches—general PLP, restricted PLP, and Possibilistic Logic Programming—can  ...  PITA relies on tabling with answer subsumption and consists of a transformation along with an API for library functions that interface with answer subsumption.  ...  The work of the first author has been partially supported by the Camera di Commercio, Industria, Artigianato e Agricoltura di Ferrara, under the project titled "Image Processing and Artificial Vision for  ... 
doi:10.1017/s147106841100010x fatcat:uwvoqd7vpnbdhanhy53mqfj5cq

Agent-Based Reasoning in Medical Planning and Diagnosis Combining Multiple Strategies

Juan Carlos Nieves, Helena Lindgren, Ulises Cortés
2014 International journal on artificial intelligence tools  
The knowledge bases of these agents are captured by a class of possibilistic logic programs. Hence, these agents are able to deal with qualitative information.  ...  In this setting, we introduce the so called Hypothetic-Deductive-Domino (HD-D) algorithm.  ...  Cortés is partially supported by (CIP-ICT-PSP-2011-5 #297225) "Integrated prevention and Detection sOlutioNs Tailored to the population and Risk Factors associated with FALLs (I-DONT-FALL)". U.  ... 
doi:10.1142/s0218213014400041 fatcat:crg6bdg26jdpfiwdqpz7y5qqnq

Possibilistic uncertainty handling for answer set programming

Pascal Nicolas, Laurent Garcia, Igor Stéphan, Claire Lefèvre
2006 Annals of Mathematics and Artificial Intelligence  
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  ...  By means of a possibility distribution we define a clear semantics of such programs by introducing what is a possibilistic stable model.  ...  Like in possibilistic logic, the possibility degree of an atom set is determined by the necessity degrees of the rules of the program that are not satisfied by this set.  ... 
doi:10.1007/s10472-006-9029-y fatcat:schtv2wkfbe77mo5gmfohpr4qe

Extending Removed Sets Revision to partially preordered belief bases

Mariette Sérayet, Pierre Drap, Odile Papini
2011 International Journal of Approximate Reasoning  
The removed sets are efficiently computed thanks to a suitable encoding of the revision problem into logic programming with answer set semantics.  ...  This framework captures the possibilistic revision of partially preordered information and allows for implementing it with ASP.  ...  It does not represent the opinion of the European Community, and the European Community is not responsible for any use that might be made of data appearing therein.  ... 
doi:10.1016/j.ijar.2010.05.008 fatcat:ztsd4jt4gzfm3pqe45dkn6iaci
« Previous Showing results 1 — 15 out of 811 results