Sciweavers

1950 search results - page 130 / 390
» Lambda-Free Logical Frameworks
Sort
View
ISSAC
1990
Springer
83views Mathematics» more  ISSAC 1990»
15 years 10 months ago
Resolution Proof Systems with Weak Transformation Rules
In the previous papers [7-101we defined and explored a formal methodological framework on the basis of which resolution proof systems for strongly-finite logics can be introduced ...
Zbigniew Stachniak
LICS
1995
IEEE
15 years 10 months ago
Structural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
Frank Pfenning
ISMVL
1991
IEEE
145views Hardware» more  ISMVL 1991»
15 years 10 months ago
The Abnormality Predicate
We suggest a new representation of defeasible entailment and specificity in the framework of default logic. The representation is based on augmenting the underlying classical lan...
Eric Neufeld
LOGCOM
2007
180views more  LOGCOM 2007»
15 years 6 months ago
A Causal Theory of Abduction
The paper provides a uniform representation of abductive reasoning in the logical framework of causal inference relations. The representation covers in a single framework not only...
Alexander Bochman
DEON
2006
Springer
15 years 8 months ago
A Logical Architecture of a Normative System
Abstract. Logical architectures combine several logics into a more complex logical system. In this paper we study a logical architecture using input/output operations corresponding...
Guido Boella, Leendert W. N. van der Torre