Sciweavers

557 search results - page 84 / 112
» Useful Transformations in Answer set programming
Sort
View
ICTAI
2007
IEEE
14 years 2 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
CC
2010
Springer
190views System Software» more  CC 2010»
14 years 2 months ago
Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors?
On Chip Multiprocessors (CMP), it is common that multiple cores share certain levels of cache. The sharing increases the contention in cache and memory-to-chip bandwidth, further h...
Yunlian Jiang, Eddy Z. Zhang, Kai Tian, Xipeng She...
AGP
1999
IEEE
14 years 12 days ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
AMAST
2008
Springer
13 years 10 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
AAAI
2007
13 years 10 months ago
Generality and Equivalence Relations in Default Logic
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...
Katsumi Inoue, Chiaki Sakama