81.
Keep Personal Information Safe Bring Logic Into Play Deductive Reasoning
Anatomy of A Load Test This dissection helps explain all the
82.
LOLA- A Logic Language for Deductive Databases and its Implementation
- Heribert Schiitz; Giint Specht
The purpose of this paper is to give an overview of the LOLA logic programming system which serves as the kernel of a deductive database system. The LOLA lan-guage, the query evaluation strategy, the available query optimiaations, the overall compiler architecture, and some implementational details and performance measurements are presented. The LOLA-system is fully implemented in Common Lisp and running on SUN UNIX Workstations. 1
83.
Logic, inductive and deductive; an introduction to scientific method,
- Jones, Adam Leroy.
x p., 1 l., 304 p.
84.
Elements of deductive logic. By Noah K. Davis ...
- Davis, Noah Knowles, 1830-1910.
x, 208 p.
85.
The elements of deductive logic-- By Thomas Fowler
- Fowler, Thomas, 1832-1904.
9th ed., cor. and rev.
86.
The theory of thought. A treatise on deductive logic ...
- [Davis, Noah Knowles], 1830-
x, 316 p.
87.
A Dynamic Logic for Deductive Verification of C Programs with KeY-C
- Oleg Mürk; Daniel Larsson; Reiner Hähnle
Abstract. We present KeY-C: a tool for deductive verification of C programs. KeY-C allows verification of C programs w.r.t. operation contracts and invariants. It is based on an earlier version of KeY that supports Java Card. In this paper we outline syntax, semantics, and calculus of C Dynamic Logic (CDL) that were adapted from their Java Card counterparts. Currently, the tool is in an early development stage. As a side-product of this work we expect to generalize KeY architecture for easily adding the support for new programming languages. This paper is a further development of our work described in [11]....
88.
A Dynamic Logic for Deductive Verification of C Programs with KeY-C
- Oleg Mürk; Daniel Larsson; Reiner Hähnle
Abstract. We present KeY-C: a tool for deductive verification of C programs. KeY-C allows verification of C programs w.r.t. operation contracts and invariants. It is based on an earlier version of KeY that supports Java Card. In this paper we outline syntax, semantics, and calculus of C Dynamic Logic (CDL) that were adapted from their Java Card counterparts. Currently, the tool is in an early development stage. As a side-product of this work we expect to generalize KeY architecture for easily adding the support for new programming languages. This paper is a further development of our work described in [11]....
89.
OOLP: A Translation Approach to Object-Oriented Logic Programming Deductive and Object-Oriented Databases
- Mukesh Dalal; Dipayan Gangopadhyay
OOLP integrates the superior modeling capabilities of object-oriented paradigm in the declarative framework of logic programming. Method invocation in OOLP is given a precise model theoretic semantics which is consistent with that of logic programming. OOLP is extended to a practical object-oriented database language OOLP+ by adding some extra-logical features. OOLP+ allows object identity, multiple inheritance, method overriding and dynamic updating among other features. OOLP+ is implemented by translating it to Prolog. The translated programs executes without metainterpretation. This allows the use of all Prolog or Datalog optimization techniques. In this respect OOLP+ is unique among alternative proposals presented in...
90.
A Dynamic Logic for Deductive Verification of Concurrent Java Programs With Condition Variables
- Bernhard Beckert; Vladimir Klebanov
91.
A Dynamic Logic for Deductive Verification of Concurrent Java Programs With Condition Variables
- Bernhard Beckert; Vladimir Klebanov
92.
The Oxford handbook of logic, deductive and inductive : specially adapted for the use of candidates for moderations at Oxford : with questions that have been set in the schools, together with answers to the same / by E.L. Hawkins.
- Hawkins, Edward L.
5th. ed. rev. and partly rewritten.
93.
Handling XML with a Deductive Database System
We propose an integration of XML with F-Logic, a deductive object-oriented database framework.
94.
Active Logic, Labeled Deductive Systems, reasoning with limited resources Reasoning with Limited Resources: Active Logics Expressed as Labeled Deductive Systems
Reasoning with limited computational resources (such as time or memory) is an important problem, in particular in knowledge-intensive embedded systems. Classical logic is usually considered inapropriate for this purpose as no guarantees regarding deadlines can be made. One of the more interesting approaches to address this problem is built around the concept of active logics. Although a step in the right direction, active logics still do not offer the ultimate solution. Our work is based on the assumption that Labeled Deductive Systems offer appropriate metamathematical methodology to study the problem. As a first step, we have reformulated a pair of...
95.
Review: Alfred Tarski, T. R. Bachiller, J. R. Fuentes, Introduccion a la Logica y a la Metodologia de las Ciencias Deductivas
- Church, Alonzo
96.
Review: William Kneale, The Province of Logic; Hugues Leblanc, An Introduction to Deductive Logic
- L'Abbe, Maurice
97.
NAIL (Not Another Implementation of Logic) was a prototype deductive database system developed at Stanford.
- The Principal Designers; Were Marcia Derr; Shinichi Morishita
F14.69> end; ffl Condition is a rule body. ffl Its value is "true" iff the body is nonempty. ffl Similar idea: repeat, loop, if-then-else statements. Example: (1) module semi; (2) export main(:); (3) edb arc(X,Y), path(X,Y); (4) prog main(:) (5) rels newPath(X,Y); (6) arc(X,Y) := --. (7) arc(1,2). (8) arc(2,3). (9) arc(3,4). (10) arc(4,5). (11) arc(2,4). (12) newPath(X,Y) := arc(X,Y). (13) path(X,Y) := --. (14) while newPath(X,Y) do (15) path(X,Y) += newPath(X,Y). (16) newPath(X,Y) := newPath(X,Z) & arc(Z,Y). (17) newPath(X,Y) -= path(X,Y). (18) end; (19) end (20) end This program performs seminaive
98.
A text-book of deductive logic for the use of students, by P.K. Ray.
- Ray, Prasanta K.
322 p.
99.
A text-book of deductive logic for the use of students. By P.K. Ray ...
- Ray, Prasanna K.
2d ed.
100.
Inductive-Deductive Systems: A mathematical logic and statistical learning perspective
- Nicolas Baskiotis; Olivier Teytaud; Michele Sebag
Abstract. The theorems about incompleteness of arithmetic have often been cited as an argument against automatic theorem proving and expert systems. However, these theorems rely on a worst-case analysis, which might happen to be overly pessimistic with respect to real-world domain applications. For this reason, a new framework for a probabilistic analysis of logical complexity is presented in this paper. Specifically, the rate of nondecidable clauses and the convergence of a set of axioms toward the target one when the latter exists in the language are studied, by combining results from mathematical logic and from statistical learning. Two theoretical settings...
