846 search results - page 37 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
155
click to vote
IGPL
1998
15 years 5 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
159
Voted
AAAI
2006
15 years 7 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
146
click to vote
AIR
2010
15 years 6 months ago
2010
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
160
click to vote
TE
2010
15 years 25 days ago
2010
Abstract--As demand increases for circuits with higher performance, higher complexity, and decreased feature size, asynchronous (clockless) paradigms will become more widely used i...
153
click to vote
FLOPS
2004
Springer
15 years 11 months ago
2004
Springer
We present a graphical tool for the declarative debugging of wrong answers in functional-logic languages. The tool, integrated in the system T OY, can be used to navigate a computa...