Sciweavers

6554 search results - page 386 / 1311
» Constraint Logic Programming
Sort
View
IJCAI
2001
15 years 8 months ago
Graph Theoretical Characterization and Computation of Answer Sets
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
Thomas Linke
SPC
2005
Springer
16 years 6 days ago
A Theorem Proving Approach to Analysis of Secure Information Flow
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
Ádám Darvas, Reiner Hähnle, Dav...
PODS
2000
ACM
102views Database» more  PODS 2000»
15 years 11 months ago
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
Floris Geerts, Bart Kuijpers
SAS
2007
Springer
16 years 25 days ago
Refactoring Using Type Constraints
Type constraints express subtype-relationships between the types of program expressions that are required for type-correctness, and were originally proposed as a convenient framewo...
Frank Tip
CP
2004
Springer
16 years 3 days ago
Global Constraints for Integer and Set Value Precedence
The paper introduces value precedence on integer and set sequences. A useful application of the notion is in breaking symmetries of indistinguishable values, an important class of ...
Yat Chiu Law, Jimmy Ho-Man Lee