2022 search results - page 68 / 405 » Complexity of Non-Monotonic Logics |
116
click to vote
LOPSTR
1997
Springer
15 years 4 months ago
1997
Springer
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
95
Voted
CLIMA
2007
15 years 2 months ago
2007
Over the years, Logic Programming has proved to be a good and natural tool for expressing, querying and manipulating explicit knowledge in many areas of computer science. However, ...
123
click to vote
CCS
2011
ACM
14 years 19 days ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
113
Voted
ECCC
2008
15 years 22 days ago
2008
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...
130
Voted
ADBIS
2004
Springer
15 years 6 months ago
2004
Springer
The richer data models of object relational databases opens many more options for the logical design of a database schema increasing the complexity of logical database design enorm...