1568 search results - page 106 / 314 » Fusions of Description Logics |
199
click to vote
ASP
2005
Springer
15 years 12 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
179
click to vote
ESWS
2005
Springer
15 years 12 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
206
click to vote
ASIAN
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Clever algorithm design is sometimes superseded by simple encodings into logic. We apply this motto to a few case studies in the formal verification of security propertie...
149
click to vote
CADE
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We present a technique that efficiently translates propositional intuitionistic formulas into propositional classical formulas. This technique allows the use of arbitrary...
166
click to vote
APAL
2004
15 years 6 months ago
2004
Modus ponens provides the central theme. There are laws, of the form A C. A logic (or other theory) L collects such laws. Any datum A (or theory T incorporating such data) provid...