63 search results - page 5 / 13 » Proving Atomicity: An Assertional Approach |
JELIA
2010
Springer
13 years 5 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...
EJC
2010
13 years 7 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...
LOPSTR
2005
Springer
14 years 14 days 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...
AIMSA
2000
Springer
13 years 11 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 ...
CORR
2011
Springer
13 years 2 months 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...