Sciweavers

338 search results - page 27 / 68
» Many Facets of Complexity in Logic
Sort
View
LICS
2006
IEEE
14 years 1 months ago
Fixed-Parameter Hierarchies inside PSPACE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
Guoqiang Pan, Moshe Y. Vardi
WISE
2002
Springer
14 years 9 days ago
Towards Declarative XML Querying
How to extract data from XML documents is an important issue for XML research and development. However, how to view XML documents determines how they can be queried. In this paper...
Mengchi Liu, Tok Wang Ling
QSIC
2003
IEEE
14 years 20 days ago
A Dialog Control Framework for Hypertext-Based Applications
Hypertext-based user interfaces have become attractive for many distributed applications today, but they do not reach the usability level of window-based UIs. Because of insuffici...
Matthias Book, Volker Gruhn
VTS
1997
IEEE
73views Hardware» more  VTS 1997»
13 years 11 months ago
Obtaining High Fault Coverage with Circular BIST Via State Skipping
Despite all of the advantages that circular BIST ofsers compared to conventional BIST approaches in terms of low area overhead, simple control logic, and easy insertion, it has se...
Nur A. Touba
RR
2010
Springer
13 years 5 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof