1 citations · 1 across the 5 of their papers we have counts for
5 papers
How to Split a Logic Program
Rachel Ben-Eliyahu-Zohary
Answer Set Programming (ASP) is a successful method for solving a range of real-world applications. Despite the availability of fast ASP solvers, computing answer sets demands a ve…
On the Tractability of Minimal Model Computation for Some CNF Theories
Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Fabio Fassetti +1
Designing algorithms capable of efficiently constructing minimal models of CNFs is an important task in AI. This paper provides new results along this research line and presents ne…
Outlier detection in default logics: the tractability/intractability frontier
F. Angiulli, R. Ben-Eliyahu-Zohary, L. Palopoli
In default theories, outliers denote sets of literals featuring unexpected properties. In previous papers, we have defined outliers in default logics and investigated their formal…
Computational Properties of Metaquerying Problems
F. Angiulli, R. Ben-Eliyahu-Zohary, G. Ianni +1
Metaquerying is a datamining technology by which hidden dependencies among several database relations can be discovered. This tool has already been successfully applied to several…
A Hierarchy of Tractable Subsets for Computing Stable Models
R. Ben-Eliyahu
Finding the stable models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of truth maintenance system…