Sciweavers

1144 search results - page 48 / 229
» Logic programming for combinatorial problems
Sort
View
JAPLL
2006
97views more  JAPLL 2006»
13 years 7 months ago
Model checking propositional dynamic logic with all extras
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
Martin Lange
CPAIOR
2010
Springer
14 years 15 days ago
Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
Elvin Coban, John N. Hooker
CLEIEJ
2010
13 years 5 months ago
Logic Programming: Can the learning and teaching process be improved apart from standards adopted by most professors and establi
Logic programming is one of the most important subjects for students pursuing a degree in Information Technology and Communication (ITC) at higher education institutions. Teaching ...
Ricardo Luiz B. L. Campos
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
14 years 1 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
SLP
1997
102views more  SLP 1997»
13 years 9 months ago
Compositionality of Normal Open Logic Programs
Compositionality of programsis an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly be...
Sofie Verbaeten, Marc Denecker, Danny De Schreye