4 papers
Improving probability selecting based weights for Satisfiability Problem
Huimin Fu, Yang Xu, Jun Liu +2
The Boolean Satisfiability problem (SAT) is important on artificial intelligence community and the impact of its solving on complex problems. Recently, great breakthroughs have bee…
GRUNGE: A Grand Unified ATP Challenge
Chad E. Brown, Thibault Gauthier, Cezary Kaliszyk +2
This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms. The formalism…
Modeling in OWL 2 without Restrictions
Michael Schneider, Sebastian Rudolph, Geoff Sutcliffe
The Semantic Web ontology language OWL 2 DL comes with a variety of language features that enable sophisticated and practically useful modeling. However, the use of these features…
Reasoning in the OWL 2 Full Ontology Language using First-Order Automated Theorem Proving
Michael Schneider, Geoff Sutcliffe
OWL 2 has been standardized by the World Wide Web Consortium (W3C) as a family of ontology languages for the Semantic Web. The most expressive of these languages is OWL 2 Full, but…