Sciweavers

9842 search results - page 1832 / 1969
» Problem complexity
Sort
View
LPNMR
2007
Springer
15 years 6 months ago
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
Stefan Woltran
85
Voted
ICCAD
1996
IEEE
93views Hardware» more  ICCAD 1996»
15 years 4 months ago
VERILAT: verification using logic augmentation and transformations
This paper presents a new framework for formal logic verification. What is depicted here is fundamentally different from previous approaches. In earlier approaches, the circuit is ...
Dhiraj K. Pradhan, Debjyoti Paul, Mitrajit Chatter...
90
Voted
ATAL
2008
Springer
15 years 2 months ago
Resource limitations, transmission costs and critical thresholds in scale-free networks
Whether or not a critical threshold exists when epidemic diseases are spread in complex networks is a problem attracting attention from researchers in several disciplines. In 2001...
Chung-Yuan Huang, Chuen-Tsai Sun, Chia-Ying Cheng,...
119
Voted
DLOG
2006
15 years 2 months ago
Tableau Caching for Description Logics with Inverse and Transitive Roles
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
Yu Ding, Volker Haarslev
NIPS
1993
15 years 2 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson
« Prev « First page 1832 / 1969 Last » Next »