Results 141 to 150 of about 416,627 (195)
Some of the next articles are maybe not open access.
An integration of deductive retrieval into deductive synthesis
14th IEEE International Conference on Automated Software Engineering, 2003Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of correct programs. In this paper, we describe an integration of both methods which combines their complementary benefits and alleviates some of their drawbacks.
Bernd Fischer 0002, Jon Whittle 0001
openaire +1 more source
2001
In this paper, we consider some of the problems that arise if automated reasoning methods are applied to natural language semantics. It turns that out that the problem of ambiguity has a strong impact on the feasibility of any theorem prover for computational semantics.
Monz, C., de Rijke, M.
openaire +2 more sources
In this paper, we consider some of the problems that arise if automated reasoning methods are applied to natural language semantics. It turns that out that the problem of ambiguity has a strong impact on the feasibility of any theorem prover for computational semantics.
Monz, C., de Rijke, M.
openaire +2 more sources
WIREs Cognitive Science, 1999
AbstractThis article begins with an account of logic, and of how logicians formulate formal rules of inference for the sentential calculus, which hinges on analogs of negation and the connectivesif, or, andand. It considers the various ways in which computer scientists have written programs to prove the validity of inferences in this and other domains.
openaire +3 more sources
AbstractThis article begins with an account of logic, and of how logicians formulate formal rules of inference for the sentential calculus, which hinges on analogs of negation and the connectivesif, or, andand. It considers the various ways in which computer scientists have written programs to prove the validity of inferences in this and other domains.
openaire +3 more sources
Deduction and deductive databases for geographic data handling
1993The representation of complex spatial domains in conventional databases suffers from fragmented representation of object structure, lack of instance-level spatial relationships, and the generation of large combinatoric search spaces in query analysis.
Alia I. Abdelmoty +2 more
openaire +1 more source
Bulletin of Symbolic Logic, 1996
AbstractThis is an exposition of Lambek's strengthening and generalization of the deduction theorem in categories related to intuitionistic propositional logic. Essential notions of category theory are introduced so as to yield a simple reformulation of Lambek's Functional Completeness Theorem, from which its main consequences can be readily drawn. The
openaire +2 more sources
AbstractThis is an exposition of Lambek's strengthening and generalization of the deduction theorem in categories related to intuitionistic propositional logic. Essential notions of category theory are introduced so as to yield a simple reformulation of Lambek's Functional Completeness Theorem, from which its main consequences can be readily drawn. The
openaire +2 more sources
Synthese, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Journal of Automated Reasoning, 1987
The main contribution of the paper is the goal-oriented hierarchical deduction proof procedure. The procedure proves a theorem by producing not just one but all the acceptable resolvents from the goal clause. There is a set of completeness-preserving refinements to constrain the generation of the irrelevant resolvents.
Tie-Cheng Wang, W. W. Bledsoe
openaire +1 more source
The main contribution of the paper is the goal-oriented hierarchical deduction proof procedure. The procedure proves a theorem by producing not just one but all the acceptable resolvents from the goal clause. There is a set of completeness-preserving refinements to constrain the generation of the irrelevant resolvents.
Tie-Cheng Wang, W. W. Bledsoe
openaire +1 more source
Journal of Philosophical Logic, 2012
For deductive reasoning to be justified, it must be guaranteed to preserve truth from premises to conclusion; and for it to be useful to us, it must be capable of informing us of something. How can we capture this notion of information content, whilst respecting the fact that the content of the premises, if true, already secures the truth of the ...
openaire +1 more source
For deductive reasoning to be justified, it must be guaranteed to preserve truth from premises to conclusion; and for it to be useful to us, it must be capable of informing us of something. How can we capture this notion of information content, whilst respecting the fact that the content of the premises, if true, already secures the truth of the ...
openaire +1 more source
2000
Deduction is usually considered to be the opposite of induction. However, deduction and induction can be related in many ways. In this paper, two endeavors that try to relate discovery science and verification technology are described. The first is discovery by deduction, where attempts to find algorithms are made using verifiers.
Masami Hagiya, Koichi Takahashi
openaire +1 more source
Deduction is usually considered to be the opposite of induction. However, deduction and induction can be related in many ways. In this paper, two endeavors that try to relate discovery science and verification technology are described. The first is discovery by deduction, where attempts to find algorithms are made using verifiers.
Masami Hagiya, Koichi Takahashi
openaire +1 more source