Sciweavers

3119 search results - page 457 / 624
» General Default Logic
Sort
View
SAC
2006
ACM
15 years 6 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
JFP
2007
126views more  JFP 2007»
15 years 6 months ago
Engineering Software Correctness
Software engineering courses offer one of many opportunities for providing students with a significant experience in declarative programming. This report discusses some results fr...
Rex L. Page
CCR
2005
131views more  CCR 2005»
15 years 6 months ago
A clean slate 4D approach to network control and management
Today's data networks are surprisingly fragile and difficult to manage. We argue that the root of these problems lies in the complexity of the control and management planes--...
Albert G. Greenberg, Gísli Hjálmt&ya...
CORR
2004
Springer
177views Education» more  CORR 2004»
15 years 6 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
LOGCOM
1998
178views more  LOGCOM 1998»
15 years 6 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh