Results 251 to 260 of about 87,998 (303)
Some of the next articles are maybe not open access.
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
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 +3 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 +3 more sources
Synthese, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
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 +2 more sources
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 +2 more sources
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
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
Synthese, 2011
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 +2 more sources
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 +2 more sources
Novelty in deductive databases
Journal of Logic and Computation, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grégoire, Éric, Marquis, Pierre
openaire +3 more sources
Abduction is not Deduction-in-Reverse
Logic Journal of IGPL, 1996Summary: Abduction is a topic that attracts much interest in AI and automated reasoning research. Different approaches have been devised, that give a formalized account of explanatory reasoning, propose methods to compute explanations, frame abduction in the context of logic programming.
Marta Cialdea Mayer +1 more
openaire +3 more sources