4617 search results - page 212 / 924 » Automation of Diagrammatic Reasoning |
289
click to vote
NIL
1991
15 years 10 months ago
1991
In this paper we continue investigations of proof theory of default logic. It turns out that, similarly to classical logic, default theories can be represented in normal forms.
123
click to vote
DLOG
2007
15 years 8 months ago
2007
We present an new Prot´eg´e plugin for constructing a minimal satisfiability model of an OWL ontology and visualizing it in the original music score notation.
116
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a recursion-theoretic characterization of the complexity classes NCk
176
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
149
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Since Parigot's seminal article on an algorithmic interpretation of classical natural deduction [13],