4266 search results - page 16 / 854 » A Framework for Defining Logics |
CADE
2006
Springer
15 years 10 months ago
2006
Springer
Access-control policies have grown from simple matrices to non-trivial specifications written in sophisticated languages. The increasing complexity of these policies demands corres...
90
Voted
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
88
Voted
FUIN
2010
14 years 7 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
MICAI
2000
Springer
15 years 1 months ago
2000
Springer
We introduce the new paradigm of High-Level Non-Monotonic reasoning (HLNM). This paradigm is the consolidation of our recent results on disjunctions, sets, explicit and implicit ne...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...