Sciweavers

2022 search results - page 362 / 405
» Complexity of Non-Monotonic Logics
Sort
View
73
Voted
CORR
2004
Springer
140views Education» more  CORR 2004»
14 years 10 months ago
Checking modes of HAL programs
Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generatio...
Maria J. García de la Banda, Warwick Harvey...
INTEGRATION
2000
71views more  INTEGRATION 2000»
14 years 10 months ago
A hardware implementation of realloc function
The memory intensive nature of object-oriented languages such as C++ and Java has created the need of a high-performance dynamic memory management. Objectoriented applications oft...
Witawas Srisa-an, Chia-Tien Dan Lo, J. Morris Chan...
JAIR
2000
105views more  JAIR 2000»
14 years 10 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber
DEDS
1998
152views more  DEDS 1998»
14 years 10 months ago
Timed Petri Nets in Hybrid Systems: Stability and Supervisory Control
In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in de...
Xenofon D. Koutsoukos, Kevin X. He, Michael D. Lem...
TCS
2002
14 years 10 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella