| http://www.w3.org/ns/prov#value | - The purity and minimalism of our approach allows us to declare arithmetic in other logic systems, such as Haskell type classes.To prove decidability, correctness and other properties of our predicates we have developed a new semantics of normal logic programs: solution sets.
|
