Results 1  10
of
128
A Linear Logical Framework
, 1996
"... We present the linear type theory LLF as the forAppeared in the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science  LICS'96 (E. Clarke editor), pp. 264275, New Brunswick, NJ, July 2730 1996. mal basis for a conservative extension of the LF logical framework. ..."
Abstract

Cited by 234 (48 self)
 Add to MetaCart
We present the linear type theory LLF as the forAppeared in the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science  LICS'96 (E. Clarke editor), pp. 264275, New Brunswick, NJ, July 2730 1996. mal basis for a conservative extension of the LF logical framework
Transformers for Symbolic Computation and Formal Deduction
 Proceedings of the Workshop on the Role of Automated Deduction in Mathematics, CADE17
, 2000
"... . A transformer is a function that maps expressions to expressions. Many transformational operatorssuch as expression evaluators and simpliers, rewrite rules, rules of inference, and decision procedurescan be represented by transformers. Computations and deductions can be formed by applying so ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
sound transformers in sequence. This paper introduces machinery for dening sound transformers in the context of an axiomatic theory in a formal logic. The paper is intended to be a rst step in a development of an integrated framework for symbolic computation and formal deduction. 1 Introduction
Deductive Verification of Component Model: Combining Computation Tree Logic and Deontic Logic in Natural Deduction Style Calculus.
"... systems, reconfiguration. Abstract. In this paper we present a natural deduction calculus for branchingtime deontic logic, a combination of the branchingtime logic CTL and deontic modalities. We show how this new proof technique can be applied as a reasoning tool in modeling dynamic normative sys ..."
Abstract
 Add to MetaCart
systems, reconfiguration. Abstract. In this paper we present a natural deduction calculus for branchingtime deontic logic, a combination of the branchingtime logic CTL and deontic modalities. We show how this new proof technique can be applied as a reasoning tool in modeling dynamic normative
RasiowaSikorski Deduction Systems: a Handy Tool for Computer Science Logics
 Recent Trends in Algebraic Specification Techniques, volume 1589 of LNCS
, 1998
"... . A RasiowaSikorski system is a sequencetype formalization of logics based on building decomposition trees of formulae labelled with sequences of formulae. Proofs are nite decomposition trees with leaves having \fundamental", valid labels. The system is dual to the tableau system. The author ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. A RasiowaSikorski system is a sequencetype formalization of logics based on building decomposition trees of formulae labelled with sequences of formulae. Proofs are nite decomposition trees with leaves having \fundamental", valid labels. The system is dual to the tableau system. The author
Automated Deduction and its Application to Mathematics
, 2011
"... The goal of researchers in automated deduction is to develop methods and tools to assist mathematicians, scientists, and engineers with some of the deductive aspects of their work. In contrast to other symbolic computation systems, the core methods in automated deduction focus on searching for proof ..."
Abstract
 Add to MetaCart
for proofs and counterexamples. Automated deduction can be applied to wideranging problems in nearly any formal language. However, for problems in abstract mathematics and logic, it has been most successful to date when applied to problems stated in firstorder and equational logic. This workshop
Modelling Inference in Argumentation through Labelled Deduction: Formalization and Logical Properties
"... Abstract. Artificial Intelligence (AI) has long dealt with the issue of finding a suitable formalization for commonsense reasoning. Defeasible argumentation has proven to be a successful approach in many respects, proving to be a confluence point for many alternative logical frameworks. Different fo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
), respectively. As a basis for such analysis we will use the LDSar framework, a unifying approach to computational models of argument using Labelled Deductive Systems (LDS). In the context of this logical framework, we show how labels can be used to represent arguments as well as argument trees, facilitating
On Natural Deduction in FirstOrder Fixpoint Logics
, 1995
"... In the current paper we present a powerful technique of obtaining natural deduction proof systems for firstorder fixpoint logics. The term fixpoint logics refers collectively to a class of logics consisting of modal logics with modalities definable at metalevel by fixpoint equations on formulas. ..."
Abstract
 Add to MetaCart
the modalities. 1 Introduction A great deal of attention has been devoted to formalisms dealing with fixpoints. Denotational semantics, domain theory, complexity theory, specification languages  these are just a few computer science examples of such formalisms. As logic was widely applied in various areas
Computational tools for logicbased grammar formalisms
"... A wellknown slogan in language technology is ‘parsingasdeduction’: syntax and meaning analysis of a text takes the form of a mathematical proof/derivation. Developers of language technology (and students of computational linguistics) want to visualize these mathematical ..."
Abstract
 Add to MetaCart
A wellknown slogan in language technology is ‘parsingasdeduction’: syntax and meaning analysis of a text takes the form of a mathematical proof/derivation. Developers of language technology (and students of computational linguistics) want to visualize these mathematical
A Tool to Practice Formal Proofs
"... This paper presents a Logic Tutor, a tool to support computer science students in their learning of logic, more specifically in their learning of formal proofs. The current tool is equipped with a deduction system for propositional logic. However its modular conception makes it easy to change to ano ..."
Abstract
 Add to MetaCart
This paper presents a Logic Tutor, a tool to support computer science students in their learning of logic, more specifically in their learning of formal proofs. The current tool is equipped with a deduction system for propositional logic. However its modular conception makes it easy to change
Hierarchical MetaLogics: Intuitions, Proof Theory and Semantics
, 1991
"... The goal of this paper is to provide a possible foundation for metareasoning in the fields of artificial intelligence and computer science. We first investigate the relationship that we want to hold between metatheory and objecttheory. We then outline a methodology in which reflection rules serve ..."
Abstract

Cited by 14 (10 self)
 Add to MetaCart
serve to deductively generate a metatheory from its object theory. Finally, we apply this methodology and define a hierarchical metalogic, namely a formal system generating an entire metahierarchy, which is sound and complete with respect to a semantics formalising the desired meta
Results 1  10
of
128