725 search results - page 47 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
145
Voted
ASP
2005
Springer
15 years 8 months ago
2005
Springer
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
127
Voted
WDAG
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
148
click to vote
CONCUR
2005
Springer
15 years 8 months ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
116
click to vote
ICFP
2000
ACM
15 years 7 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
118
Voted
VLSID
1999
IEEE
15 years 6 months ago
1999
IEEE
We describe an improved iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. The speed and accuracy of our approach mak...