Semi-negative Abductive Logic Programs with Implicative Integrity Constraints: Semantics and Properties

2012 ◽  
pp. 33-51 ◽  
Author(s):  
Paolo Mancarella ◽  
Francesca Toni
Keyword(s):  
Integrity Constraints ◽  
Logic Programs ◽  
Abductive Logic

scholarly journals SLDNFA: An abductive procedure for abductive logic programs

1998 ◽  
Vol 34 (2) ◽  
pp. 111-167 ◽  
Author(s):  
Marc Denecker ◽  
Danny de Schreye
Keyword(s):  
Logic Programs ◽  
Abductive Logic

scholarly journals Three-valued completion for abductive logic programs

1996 ◽  
Vol 165 (1) ◽  
pp. 171-200 ◽  
Author(s):  
Frank Teusink
Keyword(s):  
Logic Programs ◽  
Abductive Logic

scholarly journals Abductive logic programs with penalization: semantics, complexity and implementation

2005 ◽  
Vol 5 (1-2) ◽  
pp. 123-159 ◽  
Author(s):  
SIMONA PERRI ◽  
FRANCESCO SCARCELLO ◽  
NICOLA LEONE
Keyword(s):  
Logic Programs ◽  
Abductive Logic

scholarly journals A Measure of Arbitrariness in Abductive Explanations

2014 ◽  
Vol 14 (4-5) ◽  
pp. 665-679 ◽  
Author(s):  
LUCIANO CAROPRESE ◽  
IRINA TRUBITSYNA ◽  
Mirosław Truszczyński ◽  
Ester Zumpano
Keyword(s):  
Logic Programming ◽  
Integrity Constraints ◽  
Basic Properties ◽  
Abductive Logic ◽  
Abductive Logic Programming ◽  
Detailed Picture

AbstractWe study the framework of abductive logic programming extended with integrity constraints. For this framework, we introduce a new measure of the simplicity of an explanation based on its degree of arbitrariness: the more arbitrary the explanation, the less appealing it is, with explanations having no arbitrariness — they are called constrained — being the preferred ones. In the paper, we study basic properties of constrained explanations. For the case when programs in abductive theories are stratified we establish results providing a detailed picture of the complexity of the problem to decide whether constrained explanations exist.

scholarly journals Consistency and trust in peer data exchange systems

2016 ◽  
Vol 17 (2) ◽  
pp. 148-204 ◽  
Author(s):  
LEOPOLDO BERTOSSI ◽  
LORETO BRAVO
Keyword(s):  
Data Exchange ◽  
Integrity Constraints ◽  
Independent Interest ◽  
Stable Model ◽  
Logic Programs ◽  
Trust Relationships ◽  
Null Values

AbstractWe propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended – possibly virtual – instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints.

Sign in / Sign up

Export Citation Format

Share Document