Sciweavers

2084 search results - page 95 / 417
» Set Constraints in Logic Programming
Sort
View
LOPSTR
2009
Springer
16 years 25 days ago
Coinductive Logic Programming with Negation
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...
Richard Min, Gopal Gupta
LPNMR
2007
Springer
16 years 13 days ago
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
Pedro Cabalar, David Pearce, Panos Rondogiannis, W...
DFT
2002
IEEE
121views VLSI» more  DFT 2002»
15 years 11 months ago
Testing Digital Circuits with Constraints
Many digital circuits have constraints on the logic values a set of signal lines can have. In this paper, we present two new techniques for detecting the illegal combinations of l...
Ahmad A. Al-Yamani, Subhasish Mitra, Edward J. McC...
PLILP
1993
Springer
15 years 10 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
ECAI
2004
Springer
15 years 11 months ago
Soft Constraints with Partially Ordered Preferences
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
Nic Wilson