2022 search results - page 47 / 405 » Complexity of Non-Monotonic Logics |
NIPS
2001
15 years 2 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
132
Voted
FOSSACS
2008
Springer
15 years 2 months ago
2008
Springer
We present a translation from a logic of access control with a "says" operator to the classical modal logic S4. We prove that the translation is sound and complete. We al...
100
Voted
WCE
2007
15 years 1 months ago
2007
- We proposed the cost effective (in sense of gate number) asynchronous two-level logic. It is based on AND-OR implementation of minimized logic functions. We formulated and proved...
111
click to vote
IJAR
2008
15 years 18 days ago
2008
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider g...
110
click to vote
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...