725 search results - page 114 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
131
click to vote
ICPPW
2003
IEEE
15 years 7 months ago
2003
IEEE
Users have been demanding information “anytime, anywhere”. The notion of accessing diverse and autonomous information repositories with different APIs is not accepted. This ha...
117
Voted
SLP
1994
15 years 3 months ago
1994
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
112
Voted
ICALP
1994
Springer
15 years 6 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
131
Voted
DBPL
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
144
Voted
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...