496 search results - page 71 / 100 » Practical Reasoning for Very Expressive Description Logics |
LPAR
2001
Springer
15 years 2 months ago
2001
Springer
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
LPNMR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...
107
click to vote
DLOG
2007
14 years 12 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
MKM
2007
Springer
15 years 3 months ago
2007
Springer
An axiomatic theory represents mathematical knowledge declaratively as a set of axioms. An algorithmic theory represents mathematical knowledge procedurally as a set of algorithms....
DLOG
2009
14 years 7 months ago
2009
We report on event recognition within the life logging application IYOUIT for the automatic creation of static diary-like Blogs. Based on the qualitative context histories produced...