63 search results - page 5 / 13 » Proving Atomicity: An Assertional Approach |
173
Voted
JELIA
2010
Springer
15 years 4 months ago
2010
Springer
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
162
Voted
EJC
2010
15 years 6 months ago
2010
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
158
Voted
LOPSTR
2005
Springer
15 years 11 months ago
2005
Springer
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exc...
144
Voted
AIMSA
2000
Springer
15 years 10 months ago
2000
Springer
In the present paper we use the approach of height functions to de ning a semi-distance measure between Horn clauses. This appraoch is already discussed elsewhere in the framework ...
162
Voted
CORR
2011
Springer
15 years 28 days ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...