Dataset - CKAN

Automated Synthesis of a Finite Complexity Ordering for Saturation

We present in this paper a new procedure to saturate a set of clauses with respect to a well-founded ordering on ground atoms such that A < B implies Var(A) ⊆...
- HTML

You can also access this registry using the API (see API Docs).