725 search results - page 14 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
152
click to vote
KSEM
2010
Springer
15 years 25 days ago
2010
Springer
Abstract. In this paper, we compare merging operators in possibilistic logic. We first propose an approach to evaluating the discriminating power of a merging operator. After that...
140
click to vote
ICFP
2007
ACM
16 years 2 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
121
click to vote
FOSSACS
2007
Springer
15 years 8 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
149
Voted
ENTCS
2006
15 years 2 months ago
2006
This paper presents a game semantics for LP, Artemov's Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us...
113
click to vote
ISMIS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The post-genomic era showed up a wide range of new challenging issues for the areas of knowledge discovery and intelligent information management. Among them, the discove...