Sciweavers

351 search results - page 45 / 71
» Classical proof forestry
Sort
View
IJCAI
2003
15 years 1 months ago
A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases
In previous work, Levesque proposed an extension to classical databases that would allow for a certain form of incomplete first-order knowledge. Since this extension was suffici...
Yongmei Liu, Hector J. Levesque
SIGCOMM
2010
ACM
14 years 12 months ago
The OKL4 microvisor: convergence point of microkernels and hypervisors
We argue that recent hypervisor-vs-microkernel discussions completely miss the point. Fundamentally, the two classes of systems h in common, and provide similar abstractions. We a...
Gernot Heiser, Ben Leslie
ACTA
2010
81views more  ACTA 2010»
14 years 12 months ago
Lifting non-finite axiomatizability results to extensions of process algebras
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
AML
2007
80views more  AML 2007»
14 years 12 months ago
Normal forms for fuzzy logics: a proof-theoretic approach
A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to ...
Petr Cintula, George Metcalfe
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 12 months ago
Logics for the Relational Syllogistic
The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relationa...
Ian Pratt-Hartmann, Lawrence S. Moss