2009
DOI: 10.1017/s1471068409990093
|View full text |Cite
|
Sign up to set email alerts
|

The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments

Abstract: We present the CIFF proof procedure for abductive logic programming with constraints, and we prove its correctness. CIFF is an extension of the IFF proof procedure for abductive logic programming, relaxing the original restrictions over variable quantification (allowedness conditions) and incorporating a constraint solver to deal with numerical constraints as in constraint logic programming. Finally, we describe the CIFF system, comparing it with state-of-the-art abductive systems and answer set solvers and sh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
5
4

Relationship

2
7

Authors

Journals

citations
Cited by 19 publications
(20 citation statements)
references
References 48 publications
0
19
0
Order By: Relevance
“…However, they define compliance as assessing if actions were executed by users with the right permissions (auditing), and focus only on incomplete traces (with complete events), while we take a more sophisticated approach to incompleteness. The adopted abductive framework, CIFF [23], only supports ground abducibles, and ICs are limited to denials. The work in [22] explores also the dimension of human confirmation of hypotheses, and proposes a human-based refinement cycle.…”
Section: Related Workmentioning
confidence: 99%
“…However, they define compliance as assessing if actions were executed by users with the right permissions (auditing), and focus only on incomplete traces (with complete events), while we take a more sophisticated approach to incompleteness. The adopted abductive framework, CIFF [23], only supports ground abducibles, and ICs are limited to denials. The work in [22] explores also the dimension of human confirmation of hypotheses, and proposes a human-based refinement cycle.…”
Section: Related Workmentioning
confidence: 99%
“…The database is updated by means of an event theory, which uses frame axioms. The ALP agent approach was developed further in the KGP agent model 24,38) . In contrast with both ALP agents and KGP agents, the operational semantics of LPS employs a destructively updated database that represents the current state.…”
Section: Agent Languagesmentioning
confidence: 99%
“…For example CIFF [Endriss et al 2004;Mancarella et al 2009] is a proof procedure for ALPs that also incorporates constraint handling as in constraint logic programming. The constraint handling is used, in particular, for dealing with temporal constraints, for example in planning ].…”
Section: Abductive Logic Programming For Smart Homes For Elderly Carementioning
confidence: 99%