899 search results - page 137 / 180 » A CTL-Based Logic for Program Abstractions |
65
Voted
ANOR
2002
15 years 9 days ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
107
click to vote
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
106
click to vote
ADC
1999
Springer
15 years 4 months ago
1999
Springer
We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive ...
98
Voted
TLCA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
80
Voted
SEMWEB
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We introduce a framework, based on logic programming, for preferential reasoning with agents on the Semantic Web. Initially, we encode the knowledge of an agent as a logi...