41.
A Relational Algebra for Functional Logic Deductive Databases
- Jesús M. Almendros-Jiménez; Antonio Becerra-Terón
In this paper, we study the integration of functional logic programming and databases by presenting a data model, and a query and data de nition language. The query and data de nition language is based on the use of a set of algebra operators over an extended relational algebra. The algebra expressions built from the extended algebra are used for expressing queries and rules. In addition, algebra expressions can be used for de ning functions, typical in a functional logic program.
42.
A Relational Algebra for Functional Logic Deductive Databases
- Jesús M. Almendros-jiménez; Antonio Becerra-terón
Abstract. In this paper, we study the integration of functional logic programming and databases by presenting a data model, and a query and data definition language. The query and data definition language is based on the use of a set of algebra operators over an extended relational algebra. The algebra expressions built from the extended algebra are used for expressing queries and rules. In addition, algebra expressions can be used for defining functions, typical in a functional logic program. 1
43.
[Mi] Minker (ed): Foundations of Deductive Databases and Logic Programming,
- Morgan Kaufmann
[Pr] Przymusinski: On the declarative semantics of deductive databases and logic programs; in [Mi], 1988. [Re1] Reiter: Towards a logical reconstruction of relational database theory, in Brodie, Mylopoulos, Schmidt (eds), On Conceptual Modelling,
44.
Semantic Issues in Deductive Databases and Logic Programs
- Halina Przymusinska; Teodor Przymusinski
this paper. In particular, the paper reports on a very significant progress made recently in this area. It also presents some results which have not yet appeared in print. The paper is organized as follows. In the next two sections we define deductive databases and logic programs. Subsequently, in Sections 4 and 5, we discuss model theory and fixed points, which play a crucial role in the definition of semantics. Section 6 is the main section of the paper and is entirely devoted to a systematic exposition and comparison of various proposed semantics. In Section 7 we discuss the relationship...
45.
An Incompleteness Result for Deductive Synthesis of Logic Programs
- Kung-kiu Lau; Mario Ornaghi
We formalise the derivation of logic programs from their specifications by deductive synthesis, and introduce the notion of uniform equivalence between logical systems. This enables us to present an incompleteness result for deductive synthesis of logic programs from first-order logic specifications. 1 Introduction Logic program synthesis was studied by some researchers in the early days of logic programming. Most notable among these are Clark, Hansson, Hogger, and Tarnlund. Automated (or semi-automated) synthesis, however, has only received serious attention much more recently. A preliminary survey, in the form of a catalogue, of logic program synthesis methods can be found in [8]....
46.
A Safe Relational Calculus for Functional Logic Deductive Databases
47.
A Safe Calculus and Algebra for Querying Functional Logic Deductive Databases?
48.
Logic : deductive and inductive / by John Grier Hibben.
- Hibben, John Grier, 1861-1933.
xvi, 439 p. ;
49.
DOI: 10.1017/S1471068403001704 Printed in the United Kingdom Minimal founded semantics for disjunctive logic programs and deductive databases
- Filippo Furfaro; Gianluigi Greco; Sergio Greco
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, minimal founded semantics seems to be more intuitive, it gives meaning to programs which are meaningless under stable model semantics and is no harder to compute. More specifically, minimal founded semantics differs from stable model semantics only for disjunctive programs having constraint rules or rules...
50.
Proceedings of the 6th International Workshop on Deductive Databases and Logic . . .
- Dietmar Seipel (eds.); Forschungszentrum Informationstechnik Gmbh; Schlo Birlinghoven; Gebrauch Verffentlicht Jegliche Inhaltsnderung; Piero Fraternali; Piero Fraternali; Carolina Ruiz; Carolina Ruiz; Dietmar Seipel; Universitt Wrzburg; Ulrich Geske; Ulrich Geske; Rudower Chaussee
The integration of concepts from logic and deduction into databases and knowledge bases has created the field of deductive databases. Logic programming provides a powerful declarative language for accessing and maintaining knowledge in databases. Techniques from relational databases and automated deduction are useful for achieving efficient retrieval and reasoning in large knowledge bases. Thus, deductive databases can be used for building intelligent information systems. The contributions in this Proceedings of the Sixth International Workshop on Deductive Databases and Logic Programming DDLP'98 are grouped into four sessions: theoretical aspects, applications, Datalog extensions, and semantics and a demo session. 3 4 Contents...
51.
Towards An Object-Oriented Methodology for Deductive Synthesis of Logic Programs
- Kung-kiu Lau; Mario Ornaghi; Fachgebiet Intellektik; Fachbereich Informatik; Technische Hochschule Darmstadt
. Quality software must be reusable, extensible, and reliable. Object-oriented programming purports to achieve these attributes by the use of classes and inheritance (informally). In this paper, we show how our existing approach to deductive synthesis of logic programs can serve as the basis for an object-oriented methodology for formal program development that achieves reusability, extensibility and correctness (formally). 1 Introduction Object-oriented programming is very much seen as the standard bearer of the software industry nowadays, because it purports to achieve the key attributes of any quality software: reusability , extensibility , and reliability (see e.g. [12, 13]). Object-oriented programming...
52.
Logic, inductive & deductive; by William Minto ...
- Minto, William, 1845-1893.
# p., 373 p. incl. diagrs.
53.
Super Logic Programs STEFAN BRASS
- Jürgen Dix; Teodor C. Przymusinski
The Autoepistemic Logic of Knowledge and Belief (AELB) is a powerful nonmonotonic formalism introduced by Teodor Przymusinski in 1994. In this paper, we specialize it to a class of theories called “super logic programs”. We argue that these programs form a natural generalization of standard logic programs. In particular, they allow disjunctions and default negation of arbitrary positive objective formulas. Our main results are two new and important characterizations of the static semantics of these programs, one syntactic, and one model-theoretic. The syntactic fixed point characterization is much simpler than the fixed point construction of the static semantics for arbitrary...
54.
Introducción a la lógica y a la metodología de las ciencias deductivas
- Tarski, Alfred
55.
Introducción a la Lógica : Y a la Metodología de las Ciencias Deductivas
- Tarski, Alfred
84-239-6480-9
56.
Logic and databases: a deductive approach
- Hervi Gallaire; Jack Minker
The purpose of this paper is to show that logic provides a convenient formalism for studying classical database problems. There are two main parts to the paper, devoted respectively to conventional databases and deductive databases. In the first part, we focus on query languages, integrity modeling and maintenance, query optimization, and data
57.
A Dynamic Logic for Deductive Verification of Concurrent Programs
In this paper, we present an approach aiming at full functional deductive verification of concurrent Java programs, based on symbolic execution. We define a DynamicLogicandadeductive verification calculus for arestricted fragment of Java with native concurrency primitives. Even though we cannot yet deal with non-atomic loops, employing the technique of symmetry reduction allows us to verify unbounded systems. ThecalculushasbeenimplementedwithintheKeYsystem, and we demonstrate it by verifying a central method of the StringBuffer class from the Java standard library.
58.
Review: Henry W. Johnstone, Elementary Deductive Logic
- Baylis, Charles A.
59.
Domain restrictions in standard deductive logic.
- Swiggart, Peter
60.
Review: Hugues Leblanc, William A. Wisdom, Deductive Logic
- Gould, William E.
