977 search results - page 75 / 196 » Logic programming with infinite sets |
120
click to vote
ESOP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
121
Voted
ASP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
100
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
218
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
ESWA
2006
15 years 16 days ago
2006
The paper demonstrates the efficient use of hybrid intelligent systems for solving the classification problem of bankruptcy. The aim of the study is to obtain classification schem...