Search Results for author:
Found 2 papers, 0 papers with code
Quantification and Aggregation over Concepts of the Ontology
To avoid nonsensical sentences in this formalism, we refine the concept of well-formed sentences, and propose a method to verify well-formedness with a complexity that is linear with the number of tokens in the formula.
Knowledge Representation Analysis of Graph Mining
For IDP and ASP, which have no native support for higher order logic, we propose the use of encoding techniques such as the disjoint union technique and the saturation technique.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
