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 | 7961 reads
|
Browse archives
Active forum topics
|
Recent comments
11 weeks 1 day ago
15 weeks 2 days ago
17 weeks 3 hours ago
17 weeks 3 hours ago
19 weeks 4 days ago
24 weeks 2 days ago
24 weeks 2 days ago
24 weeks 5 days ago
24 weeks 5 days ago
27 weeks 4 days ago