Sciweavers

311 search results - page 47 / 63
» A Bialgebraic Approach to Automata and Formal Language Theor...
Sort
View
POPL
2012
ACM
12 years 4 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
JIIS
2006
93views more  JIIS 2006»
13 years 8 months ago
Measuring inconsistency in knowledgebases
It is well-known that knowledgebases may contain inconsistencies. We provide a measure to quantify the inconsistency of a knowledgebase, thereby allowing for the comparison of the...
John Grant, Anthony Hunter
SIGSOFT
2007
ACM
14 years 9 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
14 years 9 months ago
Constraint programming for itemset mining
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
Luc De Raedt, Tias Guns, Siegfried Nijssen
IJCAI
1997
13 years 10 months ago
Implementing BDI-like Systems by Direct Execution
While the Belief, Desire, Intention (BDI) framework is one of the most influential and appealing approaches to rational agent architectures, a gulf often exists between the high-l...
Michael Fisher