abductive logic programming
Recently Published Documents


TOTAL DOCUMENTS

43
(FIVE YEARS 1)

H-INDEX

11
(FIVE YEARS 0)

Author(s):  
ELENA BELLODI ◽  
MARCO GAVANELLI ◽  
RICCARDO ZESE ◽  
EVELINA LAMMA ◽  
FABRIZIO RIGUZZI

Abstract Uncertain information is being taken into account in an increasing number of application fields. In the meantime, abduction has been proved a powerful tool for handling hypothetical reasoning and incomplete knowledge. Probabilistic logical models are a suitable framework to handle uncertain information, and in the last decade many probabilistic logical languages have been proposed, as well as inference and learning systems for them. In the realm of Abductive Logic Programming (ALP), a variety of proof procedures have been defined as well. In this paper, we consider a richer logic language, coping with probabilistic abduction with variables. In particular, we consider an ALP program enriched with integrity constraints à la IFF, possibly annotated with a probability value. We first present the overall abductive language and its semantics according to the Distribution Semantics. We then introduce a proof procedure, obtained by extending one previously presented, and prove its soundness and completeness.


2020 ◽  
Vol 176 (3-4) ◽  
pp. 321-348
Author(s):  
Marco Alberti ◽  
Marco Gavanelli ◽  
Evelina Lamma ◽  
Fabrizio Riguzzi ◽  
Ken Satoh ◽  
...  

Abductive Logic Programming (ALP) has been proven very effective for formalizing societies of agents, commitments and norms, in particular by mapping the most common deontic operators (obligation, prohibition, permission) to abductive expectations. In our previous works, we have shown that ALP is a suitable framework for representing norms. Normative reasoning and query answering were accommodated by the same abductive proof procedure, named 𝒮CIFF. In this work, we introduce a defeasible flavour in this framework, in order to possibly discharge obligations in some scenarios. Abductive expectations can also be qualified as dischargeable, in the new, extended syntax. Both declarative and operational semantics are improved accordingly, and proof of soundness is given under syntax allowedness conditions Moreover, the dischargement itself might be proved invalid, or incoherent with the rules, due to new knowledge provided later on. In such a case, a discharged expectation might be reinstated and hold again after some evidence is given. We extend the notion of dischargement to take into consideration also the reinstatement of expectations. The expressiveness and power of the extended framework, named 𝒮CIFF𝒟, is shown by modeling and reasoning upon a fragment of the Japanese Civil Code. In particular, we consider a case study concerning manifestations of intention and their rescission (Section II of the Japanese Civil Code).


2018 ◽  
Vol 18 (4) ◽  
pp. 1-20 ◽  
Author(s):  
Marco Gavanelli ◽  
Marco Alberti ◽  
Evelina Lamma

2018 ◽  
Vol 159 (1-2) ◽  
pp. 35-63 ◽  
Author(s):  
Federico Chesani ◽  
Marco Gavanelli ◽  
Evelina Lamma ◽  
Paola Mello ◽  
Marco Montali

2018 ◽  
Vol 159 (1-2) ◽  
pp. 65-93 ◽  
Author(s):  
Marco Gavanelli ◽  
Evelina Lamma ◽  
Fabrizio Riguzzi ◽  
Elena Bellodi ◽  
Riccardo Zese ◽  
...  

Author(s):  
Marco Gavanelli ◽  
Evelina Lamma ◽  
Fabrizio Riguzzi ◽  
Elena Bellodi ◽  
Zese Riccardo ◽  
...  

Author(s):  
Marco Alberti ◽  
Marco Gavanelli ◽  
Evelina Lamma ◽  
Fabrizio Riguzzi ◽  
Riccardo Zese

2016 ◽  
Vol 78 ◽  
pp. 223-240 ◽  
Author(s):  
Calin Rares Turliuc ◽  
Luke Dickens ◽  
Alessandra Russo ◽  
Krysia Broda

Sign in / Sign up

Export Citation Format

Share Document