Sciweavers

138 search results - page 5 / 28
» DATALOG with Nested Rules
Sort
View
FLAIRS
2008
14 years 12 months ago
Declarative Specification and Interpretation of Rule-Based Systems
A declarative rule inference engine can be very useful for modern distributed or heterogeneous applications, if it can be configured for multiple semantics and evaluation strategi...
Dietmar Seipel, Joachim Baumeister
114
Voted
DATAMINE
1999
152views more  DATAMINE 1999»
14 years 9 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
AAAI
2012
12 years 12 months ago
Equality-Friendly Well-Founded Semantics and Applications to Description Logics
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
Georg Gottlob, André Hernich, Clemens Kupke...
AAAI
2000
14 years 11 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
ICLP
2010
Springer
15 years 1 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
Mario Alviano