Sciweavers

7167 search results - page 1084 / 1434
» Answer Set Programming
Sort
View
113
Voted
CSL
2007
Springer
15 years 9 months ago
On the Complexity of Reasoning About Dynamic Policies
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
Stefan Göller
FOSSACS
2007
Springer
15 years 9 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
121
Voted
FSTTCS
2007
Springer
15 years 9 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
137
Voted
SAT
2007
Springer
95views Hardware» more  SAT 2007»
15 years 9 months ago
Solving Multi-objective Pseudo-Boolean Problems
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
Martin Lukasiewycz, Michael Glaß, Christian ...
123
Voted
UM
2007
Springer
15 years 9 months ago
Eliciting Motivation Knowledge from Log Files Towards Motivation Diagnosis for Adaptive Systems
Motivation is well-known for its importance in learning and its influence on cognitive processes. Adaptive systems would greatly benefit from having a user model of the learner’s...
Mihaela Cocea, Stephan Weibelzahl
« Prev « First page 1084 / 1434 Last » Next »