1 - 5 of 5 articles
, the logic that underpins the popular Web Ontology Language (OWL), has a high worst case complexity (N2Exptime). Decomposing the ontology into modules prior to classification, and then classifying the composites one-by-one, has been...
This work studies the relationship between verifiable and computable answers for reachability problems in rewrite theories with an underlying membership equational logic. A new definition for R, A-rewriting that allows us to solve a bigger class of reachability problems, and a calculus that...
In program analysis, the synthesis of models of logical theories representing the program semantics is often useful to prove program properties. We use order-sorted first-order logic as an appropriate framework to describe the semantics and properties of programs as given theories. Then we...
A new approach is shown that mechanically proves various theorems in plane geometry by recasting them in terms of constraint satisfaction. A Python 3 implementation called GEOPAR affords transparent proofs of well-known theorems as well as new ones, including a generalization of Morley’s Theorem.
In the original publication of the article, the reference 11 was omitted inadvertently.
Read and print from thousands of top scholarly journals.
Continue with Facebook
Log in with Microsoft
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.