Sciweavers

4573 search results - page 194 / 915
» Automated Reasoning
Sort
View
107
Voted
CSL
2006
Springer
15 years 7 months ago
Weak Bisimulation Approximants
Abstract. Bisimilarity and weak bisimilarity are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached
Will Harwood, Faron Moller, Anton Setzer
103
Voted
PLILP
1995
Springer
15 years 7 months ago
An Abstract Machine for Oz
ctMachineforOz MichaelMehl,RalfScheidhauer,andChristianSchulte RR-95-0 ResearchRepo
Michael Mehl, Ralf Scheidhauer, Christian Schulte
237
Voted
NIL
1991
15 years 7 months ago
Normal Form Results for Default Logic
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.
V. Wiktor Marek, Miroslaw Truszczynski
93
Voted
DLOG
2007
15 years 6 months ago
The Minimal Finite Model Visualization as an Ontology Debugging Tool
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.
Martins Barinskis, Guntis Barzdins
81
Voted
CSL
2008
Springer
15 years 5 months ago
Recursion Schemata for NCk
Abstract. We give a recursion-theoretic characterization of the complexity classes NCk
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Mari...