2084 search results - page 67 / 417 » Set Constraints in Logic Programming |
NMR
2004
Springer
14 years 1 months ago
2004
Springer
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
LPNMR
2001
Springer
14 years 14 days ago
2001
Springer
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for suc...
HYBRID
2004
Springer
14 years 1 months ago
2004
Springer
We present a new high-level programming language, called XGIOTTO, for programming applications with hard real-time constraints. Like its predecessor, XGIOTTO is based on the LET (l...
PTS
2010
13 years 5 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...