74 search results - page 12 / 15 » On the Parameterized Complexity of Default Logic and Autoepi... |
FORTE
2004
14 years 11 months ago
2004
Abstract. We propose a framework for intrusion detection that is based on runtime monitoring of temporal logic specifications. We specify intrusion patterns as formulas in an expre...
ICALP
2010
Springer
15 years 8 days ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
AGP
2003
IEEE
15 years 3 months ago
2003
IEEE
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
FPGA
1997
ACM
15 years 2 months ago
1997
ACM
Programmable logic architectures increase in capacity before commercial circuits are designed for them, yielding a distinct problem for FPGA vendors: how to test and evaluate the ...