Sciweavers

1763 search results - page 205 / 353
» A Formalization of Polytime Functions
Sort
View
152
Voted
ACSD
1998
IEEE
125views Hardware» more  ACSD 1998»
15 years 6 months ago
Hierarchical Concurrent Finite State Machines in Ptolemy
We implement a finite state machine (FSM) domain for specifying and simulating control functionality of a system within the Ptolemy software environment. The FSM domain is success...
Bilung Lee, Edward A. Lee
97
Voted
LOPSTR
1999
Springer
15 years 6 months ago
Roles of Program Extension
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...
Ralf Lämmel, Günter Riedewald, Wolfgang ...
106
Voted
AGP
1997
IEEE
15 years 6 months ago
Structural Information Analysis for CLP Languages
We present the rational construction of a generic domain for structural analysis anguages: Pattern(D ), where the parameter D is an abstract domain satisfying certain properties. ...
Roberto Bagnara
116
Voted
KR
1998
Springer
15 years 6 months ago
What Robots Can Do
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...
Hector J. Levesque
78
Voted
POPL
1997
ACM
15 years 6 months ago
Program Fragments, Linking, and Modularization
Module mechanisms have received considerable theoretical attention, but the associated concepts of separate compilation and linking have not been emphasized. Anomalous module syst...
Luca Cardelli