2501 search results - page 231 / 501 » Logics with Rank Operators |
180
click to vote
TPLP
2002
15 years 5 months ago
2002
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
149
click to vote
ECSQARU
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. A great deal of research has been devoted to nontrivial reasoning in inconsistent knowledge bases. Coherence-based approaches proceed by a consolidation operation which s...
165
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
162
click to vote
TOCL
2011
15 years 21 days ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
152
click to vote
ICCD
2006
IEEE
16 years 2 months ago
2006
IEEE
This paper presents a new scheduling technique to improve the speed, power, and scalability of a dynamic scheduler. In a high-performance superscalar processor, the instruction sc...