2022 search results - page 51 / 405 » Complexity of Non-Monotonic Logics |
90
Voted
CORR
2010
Springer
15 years 21 days ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
105
click to vote
KRDB
2001
15 years 2 months ago
2001
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...
108
click to vote
TACAS
2010
Springer
15 years 7 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
88
Voted
DEON
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. Logical architectures combine several logics into a more complex logical system. In this paper we study a logical architecture using input/output operations corresponding...
88
Voted
IGPL
2007
15 years 16 days ago
2007
In this paper, the relationship between the e-value of a complex hypothesis, H, and those of its constituent elementary hypotheses, Hj