342 search results - page 6 / 69 » Tableau Algorithms for Description Logics |
105
click to vote
TACAS
2010
Springer
15 years 7 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
83
Voted
IAT
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
81
Voted
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
Knowledge representation systems, including ones based on Description Logics (DLs), use explanation facilities to, among others, debug knowledge bases. Until now, such facilities w...
102
Voted
CADE
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
118
click to vote
DLOG
2010
14 years 10 months ago
2010
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...