User loginNavigation |
SAT 3 Proof with E Prover via OWLAn interesting little Semantic Web-related development reported by Jos De Roo (creator of the Java/C# Euler inference engine). He's got the E Prover (an equational theorem prover for clausal logic), to find a proof for the OWL (Web Ontology Language) test case "inconsistent502" (RDF, variations), which is a Description Logic encoding of one of the classic SAT 3 problems. By Danny Ayers at 2004-09-08 19:06 | Logic/Declarative | Semantics | Theory | XML | other blogs | 8467 reads
|
Browse archives
Active forum topics |
Recent comments
1 week 6 days ago
2 weeks 10 hours ago
14 weeks 18 hours ago
14 weeks 1 day ago
14 weeks 2 days ago
14 weeks 2 days ago
15 weeks 20 hours ago
15 weeks 21 hours ago
15 weeks 21 hours ago
18 weeks 1 day ago