Sciweavers

555 search results - page 94 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
AGP
1998
IEEE
14 years 1 days ago
Some Design Issues in the Visualization of Constraint Logic Program Execution
Visualization of program executions has been found useful in applications which include education and debugging. However, traditional visualization techniques often fall short of ...
Manuel Carro, Manuel V. Hermenegildo
MA
1999
Springer
155views Communications» more  MA 1999»
14 years 15 hour ago
JGram: Rapid Development of Multi-Agent Pipelines for Real-World Tasks
Many real-world tasks can be decomposed into pipelines of sequential operations (where subtasks may themselves be composed of one or more pipelines). JGram is a framework enabling...
Rahul Sukthankar, Antoine Brusseau, Ray Pelletier,...
ICTL
1994
13 years 12 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto
STACS
1994
Springer
13 years 11 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
VLDB
1992
ACM
151views Database» more  VLDB 1992»
13 years 11 months ago
A Uniform Approach to Processing Temporal Queries
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has bee...
Umeshwar Dayal, Gene T. J. Wuu