725 search results - page 13 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
98
Voted
CORR
2010
Springer
15 years 2 months 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 ...
134
click to vote
TLCA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
150
click to vote
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
123
click to vote
ICLP
2001
Springer
15 years 6 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
115
click to vote
AI
2002
Springer
15 years 2 months ago
2002
Springer
Independence--the study of what is relevant to a given problem of reasoning--is an important AI topic. In this paper, we investigate several notions of conditional independence in...