Data repair of inconsistent nonmonotonic description logic programs

Eiter, Thomas; Fink, Michael; Stepanova, Daria

doi:10.1016/j.artint.2016.06.003

Cited by 4 publications

(7 citation statements)

References 56 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[40; 37; 39] [7]) from a reasoner beyond the main reasoning result, it is reasoner-dependent. 2 Relevance: If the logic used to model the diagnosed system is stable in an application area, then reasonerdependent approaches might be the better choice as they might be advantageous in terms of diagnostic efficiency (given a suitable "glass-box" reasoner for the respective logic). E.g., when DPIs expressible by means of propositional logic are the target use case of a diagnosis system, then a reasoner-dependent algorithm based on propositional logic might be preferable to a black-box one with otherwise equal features.…”

Section: General Applicabilitymentioning

confidence: 99%

“…Diagnosis computation is one of the most integral tasks in model-based diagnosis as it allows to generate fault hypotheses, which are essential for both fault localization and repair. Due to its generality, the model-based diagnosis formalism has been used to express and tackle a wide diversity of debugging problems in application areas ranging from software [1], logic programming [2], recommender systems [3], ontologies [4] and knowledge bases [5] via hardware [6], circuits [7] and robots [8] to scheduling [9], aircrafts [10] and cars [11]. This has led to a remarkable multitude and heterogeneity of the diagnosis computation methods proposed in literature, which are often motivated by and tailored for application-specific requirements and problem cases.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

How should I compute my candidates? A taxonomy and classification of diagnosis computation algorithms

Rodler¹

2022

Preprint

View full text Add to dashboard Cite

This work proposes a taxonomy for diagnosis computation methods which allows their standardized assessment, classification and comparison. The aim is to (i) give researchers and practitioners an impression of the diverse landscape of available diagnostic techniques, (ii) allow them to easily retrieve the main features as well as pros and cons of the approaches, (iii) enable an easy and clear comparison of the techniques based on their characteristics wrt. a list of important and well-defined properties, and (iv) facilitate the selection of the "right" algorithm to adopt for a particular problem case, e.g., in practical diagnostic settings, for comparison in experimental evaluations, or for reuse, modification, extension, or improvement in the course of research.

show abstract

Section: General Applicabilitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

How should I compute my candidates? A taxonomy and classification of diagnosis computation algorithms

Rodler¹

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…HEX has been applied to a wide range of use cases. Among them are a framework for executing scheduled actions in external environments (ActHEX [14]); a system for merging belief sets based on nested HEX programs (MELD system, [24]); and an artificial agent able of playing the computer game Angry Birds (AngryHEX, [6]).…”

Section: Introductionmentioning

confidence: 99%

Integrated Algorithms for HEX-Programs and Applications in Machine Learning

Kaminski

2019

Preprint

View full text Add to dashboard Cite

show abstract

“…Our encoding is similar to the one by Eiter, Fink, and Stepanova (2016), but guesses assignments of drivers to customers such that different combinations are possible, whereby non-permissible ones can possibly be detected early by partial evaluation. An external DL-KB formulated in DL-Lite holds part of the information, e.g.…”

Section: Taxi Assignment With Ontology Accessmentioning

confidence: 99%

“…• Assignment of taxi drivers to customers under constraints, where queries to an external ontology, expressed in the lightweight description logic (DL) DL-Lite, are made via external atoms to find out locations and classify customers and drivers (Taxi Assignment with Ontology Access) (Eiter, Fink, Redl, & Stepanova, 2014b;Eiter, Fink, & Stepanova, 2016). Note that despite a similar scenario, our benchmark is different from the one used by Eiter et al (2014b), as it admits multiple solutions due to nondeterministic guessing of customer assignments.…”

Section: Benchmark Problemsmentioning

confidence: 99%

Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access

Eiter

Kaminski

Redl

et al. 2018

jair

Self Cite

View full text Add to dashboard Cite

Answer Set Programming (ASP) is a well-known declarative problem solving approach based on nonmonotonic logic programs, which has been successfully applied to a wide range of applications in artificial intelligence and beyond. To address the needs of modern applications, HEXprograms were introduced as an extension of ASP with external atoms for accessing information outside programs via an API style bi-directional interface mechanism. To evaluate such programs, conflict-driving learning algorithms for SAT and ASP solving have been extended in order to capture the semantics of external atoms. However, a drawback of the state-of-the-art approach is that external atoms are only evaluated under complete assignments (i.e., input to the external source) while in practice, their values often can be determined already based on partial assignments alone (i.e., from incomplete input to the external source). This prevents early backtracking in case of conflicts, and hinders more efficient evaluation of HEX-programs. We thus extend the notion of external atoms to allow for three-valued evaluation under partial assignments, while the two-valued semantics of the overall HEX-formalism remains unchanged. This paves the way for three enhancements: first, to evaluate external sources at any point during model search, which can trigger learning knowledge about the source behavior and/or early backtracking in the spirit of theory propagation in SAT modulo theories (SMT). Second, to optimize the knowledge learned in terms of so-called nogoods, which roughly speaking are impossible input-output configurations. Shrinking nogoods to their relevant input part leads to more effective search space pruning. And third, to make a necessary minimality check of candidate answer sets more efficient by exploiting early external evaluation calls. As this check usually accounts for a large share of the total runtime, optimization is here particularly important. We further present an experimental evaluation of an implementation of a novel HEX-algorithm that incorporates these enhancements using a benchmark suite. Our results demonstrate a clear efficiency gain over the state-of-the-art HEX-solver for the benchmarks, and provide insights regarding the most effective combinations of solver configurations.

show abstract

Data repair of inconsistent nonmonotonic description logic programs

Cited by 4 publications

References 56 publications

How should I compute my candidates? A taxonomy and classification of diagnosis computation algorithms

How should I compute my candidates? A taxonomy and classification of diagnosis computation algorithms

Integrated Algorithms for HEX-Programs and Applications in Machine Learning

Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access

Contact Info

Product

Resources

About