Sciweavers

1549 search results - page 53 / 310
» On the rules of intermediate logics
Sort
View
LPNMR
2007
Springer
14 years 3 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
14 years 9 months ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
13 years 10 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001
WWW
2011
ACM
13 years 3 months ago
A better uncle for OWL: nominal schemas for integrating rules and ontologies
We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like“variable nominal classes”within axioms. This feature allows ontology langua...
Markus Krötzsch, Frederick Maier, Adila Krisn...
POPL
2006
ACM
14 years 9 months ago
Frame rules from answer types for code pointers
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
Hayo Thielecke