3 citations · 3 across the 4 of their papers we have counts for
4 papers · 1 filter
Automated Reasoning in Non-classical Logics in the TPTP World
Alexander Steen, David Fuenmayor, Tobias Gleißner +2
Non-classical logics are used in a wide spectrum of disciplines, including artificial intelligence, computer science, mathematics, and philosophy. The de-facto standard infrastruct…
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…
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…