1686 search results - page 57 / 338 » Programs as polygraphs: computability and complexity |
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
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 propert...
NMR
2004
Springer
15 years 3 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
CHIMIT
2009
ACM
15 years 4 months ago
2009
ACM
System administrators are end-users too. And as end-users, they develop tools, create web pages, write command-line scripts, use spreadsheets, and repurpose existing tools. In sho...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
PARA
2000
Springer
15 years 1 months ago
2000
Springer
The JavaGrande Forum is a group of users, researchers, and interested parties from industry. The Forum members are either trying to use Java for resource-intensive applications or ...