4372 search results - page 280 / 875 » Algorithmic Theories of Everything |
155
click to vote
DLOG
2007
15 years 8 months ago
2007
We present a query answering technique based on notions and results from modal Correspondence Theory. It allows us to answer a wide family of conjunctive queries by polynomial redu...
159
click to vote
APN
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The research domain of process discovery aims at constructocess model (e.g. a Petri net) which is an abstract representation of an execution log. Such a Petri net should ...
151
click to vote
SEC
2008
15 years 7 months ago
2008
The performance of an intrusion detector depends on several factors, like its internal architecture and the algorithms it uses. Thus, distinct detectors can behave distinctly when ...
157
click to vote
AAAI
2006
15 years 7 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
144
click to vote
AAAI
2006
15 years 7 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...