977 search results - page 52 / 196 » Logic programming with infinite sets |
105
click to vote
NMR
2004
Springer
15 years 5 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
110
Voted
CORR
2008
Springer
15 years 19 hour ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
111
Voted
CL
2000
Springer
15 years 8 days ago
2000
Springer
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
92
Voted
FSS
2007
15 years 12 days ago
2007
We investigate the use of multilattices as the set of truth-values underlying a general fuzzy logic programming framework. On the one hand, some theoretical results about ideals o...