725 search results - page 70 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
169
click to vote
DOOD
1993
Springer
15 years 10 months ago
1993
Springer
In this paper we introduce a logical query language extended with object-oriented typing facilities. This language, called DTL (from DataTypeLog), can be seen as an extension of Da...
215
click to vote
CI
2000
15 years 6 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
265
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
157
click to vote
ICPADS
1996
IEEE
15 years 10 months ago
1996
IEEE
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
150
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Hierarchical and recursive state machines are suitable abstract models for many software systems. In this paper we extend a model recently introduced in literature, by al...