241 search results - page 18 / 49 » Bounded Nondeterminism of Logic Programs |
LOGCOM
2010
13 years 2 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
ANOR
2005
13 years 7 months ago
2005
This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP f...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
IPPS
2002
IEEE
14 years 17 days ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
IWFM
2003
13 years 9 months ago
2003
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...