Filters








159 Hits in 5.3 sec

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

A Possibilistic Inconsistency Handling in Answer Set Programming [chapter]

Pascal Nicolas, Laurent Garcia, Igor Stéphan
2005 Lecture Notes in Computer Science  
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.  ...  Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model.  ...  Conclusion In this work, we have proposed a methodology to restore the consistency of a normal logic program.  ... 
doi:10.1007/11518655_35 fatcat:dhosiesbtbhg3kxe4dqkfrse3i

Possibilistic-Based Argumentation: An Answer Set Programming Approach

Juan Carlos Nieves, Ulises Cortés, Mauricio Osorio
2008 2008 Mexican International Conference on Computer Science  
We present a possibilistic-based argumentation approach which is based on a possibilistic disjunctive language.  ...  In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information.  ...  The views expressed in this paper are not necessarily those of the SHARE-it consortium.  ... 
doi:10.1109/enc.2008.37 dblp:conf/enc/NievesCO08 fatcat:fvvkklf7irgtnohzy4jdchajm4

Semantics for Possibilistic Disjunctive Programs [article]

Juan Carlos Nieves, Mauricio Osorio, Ulises Cortés
2011 arXiv   pre-print
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  ...  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  ...  Restoring inconsistent possibilistic knowledge bases In order to restore consistency of an inconsistent possibilistic knowledge base, possibilistic logic eliminates the set of possibilistic formulae which  ... 
arXiv:1106.0776v1 fatcat:wgqq36wrtbcutib2s5ssnqtj6e

Semantics for Possibilistic Disjunctive Programs

JUAN CARLOS NIEVES, MAURICIO OSORIO, ULISES CORTÉS
2011 Theory and Practice of Logic Programming  
In addition, the approach of cuts for restoring consistency of an inconsistent possibilistic knowledge base is adopted. The approach is illustrated in a medical scenario.  ...  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  ...  Restoring inconsistent possibilistic knowledge bases In order to restore consistency of an inconsistent possibilistic knowledge base, possibilistic logic deletes the set of possibilistic formulae which  ... 
doi:10.1017/s1471068411000408 fatcat:d6be4dfdxvfgrjmssuyq34uhre

Abstracts of Recent PhDs

2011 Knowledge engineering review (Print)  
In the context of knowledge representation, by considering ideas from possibilistic logic and answer set programming approach, we define a possibilistic disjunctive logic programming approach for modelling  ...  In order to define the semantics of the possibilistic disjunctive programs, three approaches are 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  ... 
doi:10.1017/s0269888910000238 fatcat:ic34qr5vpbbo7ofrwq4c4snzhe

Possibilistic uncertainty handling for answer set programming

Pascal Nicolas, Laurent Garcia, Igor Stéphan, Claire Lefèvre
2006 Annals of Mathematics and Artificial Intelligence  
Then, we show how this introduction of a certainty level on each rule of a program can be used in order to restore its consistency in case of the program has no model at all.  ...  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  ...  Here, our approach to restore the consistency of a possibilistic normal logic program is to delete the minimum number of lesser certain rules.  ... 
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.  ...  The notion of removed set, initially defined in the context of the revision of non ordered or totally preordered information is extended to partial preorders.  ...  Acknowledgements Work partially supported by the European Community under project VENUS (Contract IST-034924) of the ''Information Society Technologies (IST) program of the 6th FP for RTD".  ... 
doi:10.1016/j.ijar.2010.05.008 fatcat:ztsd4jt4gzfm3pqe45dkn6iaci

Querying of Several DL-Lite Knowledge Bases from Various Information Sources-based Polynomial Response Unification Approach

Ghassen Hamdi, Abdelmoutia Telli, Mohamed Nazih Omri
2020 Journal of King Saud University: Computer and Information Sciences  
allow us to manage inconsistencies in the set of responses.  ...  The main contribution of this work therefore consists of studying several response strategies to queries from various data sources using a recurrent function to calculate the rank of coherence which will  ...  Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper  ... 
doi:10.1016/j.jksuci.2020.06.002 fatcat:ynhbrgv2mfbo3k6xdr7tdc67ia

Towards an intelligent possibilistic web information retrieval using multiagent system

Bilel Elayeb, Fabrice Evrard, Montaceur Zaghdoud, Mohamed Ben Ahmed, Saïd Tazi
2009 Interactive Technology and Smart Education  
This system is based on a possibilistic qualitative approach which extends the quantitative one.  ...  The insertion of the factors of preference between query terms in the calculations of the possibility and the necessity consists in increasing the scores of possibilistic relevance of the documents containing  ...  Conclusion This paper proposes a new qualitative approach for an intelligent possibilistic web IR system using multiagent approach based on HSW and PN. The first HSW consists in: .  ... 
doi:10.1108/17415650910965191 fatcat:4lpouokwnbddxhqjiy4gklgbgu

Recursive algorithms to repair prioritized and inconsistent dl-lite knowledge base [article]

Ghassen Hamdi and Abdelmoutia Telli and Mohamed Nazih Omri
2019 arXiv   pre-print
In a second time, to repair the answers of this list.  ...  The novelty of our article is the proposition of a recurring function that calculates the rank of coherence in order to manage the inconsistencies in the set of responses.  ...  On other hand, the output of our approaches is a consistent assertions associated to the sets of these answers (repair answers). Possibilistic-Based Repairs Answers.  ... 
arXiv:1912.02898v1 fatcat:5qyd7t23frhtflcijdvdqwgqye

Possibility Theory and Its Applications: Where Do We Stand? [chapter]

Didier Dubois, Henry Prade
2015 Springer Handbook of Computational Intelligence  
Possibilistic logic provides a rich representation setting, which enables the handling of lower bounds of possibility theory measures, while remaining close to classical logic.  ...  Comparative possibility relations ≥ Π obey the key axiom: for all events A, B, C, This axiom was later independently proposed by the first author [74] in an attempt to derive a possibilistic counterpart  ...  It leads to the definition of a possibilistic stable model for weighted answer-set programming [189] . Bauters et al.  ... 
doi:10.1007/978-3-662-43505-2_3 fatcat:qptvfae6hndopkvagiwlsnxaxu

Handling Exceptions in Logic Programming without Negation as Failure [chapter]

Roberto Confalonieri, Henri Prade, Juan Carlos Nieves
2011 Lecture Notes in Computer Science  
Default rules, i.e. statements of the form normally a's are b's, are usually handled in Answer Set Programming by means of negation as failure which provides a way to capture exceptions to normal situations  ...  It is shown that the approach can be applied to restore the consistency of inconsistent programs that implicitly involve specificity ordering between the rules.  ...  Moreover, our approach offers a straightforward methodology to restore the consistency of inconsistent definite programs which implicitly involve some specificity order between the rules.  ... 
doi:10.1007/978-3-642-22152-1_43 fatcat:nqssxiur4jgoxkomrer75bai7i

A Semantic Characterization ASP Base Revision

Laurent Garcia, Claire Lefèvre, Igor Stéphan, Odile Papini, Éric Würbel
2019 The Journal of Artificial Intelligence Research  
These strategies allow one to define families of rule-based revision operators. The paper presents a semantic characterization of these families of revision operators in terms of answer sets.  ...  The paper deals with base revision for Answer Set Programming (ASP). Base revision in classical logic is done by the removal of formulas.  ...  The strategy of these two approaches stems from the removal of some rules in order to restore consistency.  ... 
doi:10.1613/jair.1.11451 fatcat:2zquvotlk5bxrob2jwfeszsic4

Syntactic Propositional Belief Bases Fusion with Removed Sets [chapter]

Julien Hue, Odile Papini, Eric Wurbel
2007 Lecture Notes in Computer Science  
In order to efficiently implement RSF, the paper shows how RSF can be encoded into a logic program with answer set semantics, then presents an adaptation of the smodels system devoted to efficiently compute  ...  Finally a preliminary experimental study shows that the answer set programming approach seems promising for performing belief bases fusion on real scale applications.  ...  Acknowledgements Work partially supported by the European Community under project VENUS (Contract IST-034924) of the "Information Society Technologies (IST) program of the 6th FP for RTD".  ... 
doi:10.1007/978-3-540-75256-1_9 fatcat:qkqxfgrorzgw3jcsu3b4tqlxmi
« Previous Showing results 1 — 15 out of 159 results