662 search results - page 20 / 133 » Logic Programming with Ordered Disjunction |
CADE
2001
Springer
14 years 7 months ago
2001
Springer
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
ILP
2003
Springer
14 years 21 days ago
2003
Springer
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
LISP
2008
13 years 7 months ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended...
CL
2000
Springer
13 years 12 months ago
2000
Springer
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...