Sciweavers

1342 search results - page 88 / 269
» Ordered Programs as Abductive Systems
Sort
View
AICOM
2006
129views more  AICOM 2006»
13 years 9 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone
IOR
2006
177views more  IOR 2006»
13 years 9 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
FSTTCS
1993
Springer
14 years 1 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 9 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
ICCAD
2007
IEEE
98views Hardware» more  ICCAD 2007»
14 years 6 months ago
Device-circuit co-optimization for mixed-mode circuit design via geometric programming
Modern processing technologies offer a number of types of devices such as high-VT , low-VT , thick-oxide, etc. in addition to the nominal transistor in order to meet system perfor...
Jintae Kim, Ritesh Jhaveri, Jason Woo, Chih-Kong K...