7456 search results - page 120 / 1492 » Parallelism in Logic Programming |
113
Voted
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
119
Voted
IWFM
1998
15 years 4 months ago
1998
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
106
Voted
AIR
2010
15 years 2 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...
119
Voted
LPNMR
2004
Springer
15 years 8 months ago
2004
Springer
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the que...
129
Voted
LPNMR
2004
Springer
15 years 8 months ago
2004
Springer
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...