http://biblioteca.universia.net/vernivel.do?nivel=1102 Mostrando recursos 1 - 20 de 615 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=41921071 This paper adds the handling of negative information to a functional-logic deductive database language. By adopting as semantics for negation the so-called CRWLF, wherein the negation is intended as 'nite failure' of reduction, we will dene Herbrand algebras and models for this semantics and a x point operator to be used in a new goaldirected bottom-up evaluation mechanism based on magic transformations. This bottom-up evaluation will simulate the top-down one of the original program; in fact... http://biblioteca.universia.net/ficha.do?id=42031521 In this paper, we present an extended relational calculus for expressing queries in functional-logic deductive databases. This calculus is based on rst-order logic and handles relation predicates, equalities and inequalities over partially de ned terms, and approximation equations. Dpto Lenguajes http://biblioteca.universia.net/ficha.do?id=42043931 In this paper, we present an extended relational calculus and algebra for a functional logic deductive database language. The extended relational calculus is based on the relational rst-order logic, by adding constraints in the form of equalities and disequalities over complex (partially de ned and possibly in nite) values and interpreted functions. In addition, we propose the notion of safety over calculus formulas in order to guarantee the property of domain independence. In the case of the... Dpto Lenguajes http://biblioteca.universia.net/ficha.do?id=46891817 Traditionally logic was considered as having two branches: deductive and inductive. However the development of the subject from Frege (1879) up to about 1970 brought about a divergence between deductive and inductive logic. It is argued in this paper that developments in artificial intelligence in the last twenty or so years (particularly logic programming and machine learning) have created a new framework for logic in which deductive and inductive logic can, once again, be treated as similar... Donald Gillies http://biblioteca.universia.net/ficha.do?id=41745753 This thesis studies negation in logic and deductive databases. Among other things, two kinds of negation are discussed in detail: strong negation and nonmonotonic negation. In the logic part, we have constructed a first-order logic CF 0 of strong negation with bounded quantifiers. The logic is based on constructive logics, in particular, Thomason's logic CF. However, unlike constructive logic, quantifiers in our system as in Thomason's are static rather than dynamic. For the logic CF 0 , the ... Xuegang Wang http://biblioteca.universia.net/ficha.do?id=41441244 Considering integrity constraints and program composition, it is first argued that a semantics for logic programs and deductive databases should not accommodate inconsistencies globally like in classical logic, but locally. It is then shown that minimal logic, a natural deduction style weakening of classical logic, is sufficient to provide for a proof theory for a generalization of logic programs corresponding to deductive databases with integrity constraints and disjunctive logic programs. M... Lehr- Und Forschungseinheit Fur http://biblioteca.universia.net/ficha.do?id=41518421 Considering integrity constraints and program composition, it is argued that a semantics for logic programs and deductive databases should not accommodate inconsistencies globally like in classical logic, but locally. It is shown that minimal logic, a weakening of classical logic which precludes refutation proofs, is sufficient to provide for a proof theory for generalized programs corresponding to deductive databases and disjunctive logic programs. A (nonclassical) model theory is proposed f... Lehr- Und Forschungseinheit Fur http://biblioteca.universia.net/ficha.do?id=41481452 Traditionally logic was considered as having two branches: deductive and inductive. However the development of the subject from Frege (1879) up to about 1970 brought about a divergence between deductive and inductive logic. It is argued in this paper that developments in artificial intelligence in the last twenty or so years (particularly logic programming and machine learning) have created a new framework for logic in which deductive and inductive logic can, once again, be treated as similar... Donald Gillies,Centre For Logic,Probability In Artificial http://biblioteca.universia.net/ficha.do?id=41560975 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 sem... Kung-kiu Lau,Mario Ornaghi http://biblioteca.universia.net/ficha.do?id=41569523 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 sem... Kung-kiu Lau,Mario Ornaghi http://biblioteca.universia.net/ficha.do?id=45863413 Abstract. This paper adds the handling of negative information to a functional-logic deductive database language. By adopting as semantics for negation the so-called CRWLF, wherein the negation is intended as 'finite failure ' of reduction, we will define Herbrand algebras and models for this semantics and a fix point operator to be used in a new goaldirected bottom-up evaluation mechanism based on magic transformations. This bottom-up evaluation will simulate the top-down one of th... http://biblioteca.universia.net/ficha.do?id=46282834 This paper adds the handling of negative information to a functional-logic deductive database language. By adopting as semantics for negation the so-called CRWLF, wherein the negation is intended as 'nite failure' of reduction, we will dene Herbrand algebras and models for this semantics and a x point operator to be used in a new goaldirected bottom-up evaluation mechanism based on magic transformations. This bottom-up evaluation will simulate the top-down one of the original progra... Jesús M. Almendros-Jiménez; Antonio Becerra-Terón; Jaime Sánchez-Hernández http://biblioteca.universia.net/ficha.do?id=41549187 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 systemat... Halina Przymusinska,Teodor Przymusinski,To Our Sons Lukasz,Marcel Love http://biblioteca.universia.net/ficha.do?id=42064660 We explore a framework for argumentation (based on classical logic) in which an argument is a pair where the first item in the pair is a minimal consistent set of formulae that proves the second item (which is a formula). We provide some basic definitions for arguments, and various kinds of counter-arguments (defeaters). This leads us to the definition of canonical undercuts which we argue are the only defeaters that we need to take into account. We then motivate and formalise the notion of a... http://biblioteca.universia.net/ficha.do?id=46171459 In this paper, we present an extended relational calculus for expressing queries in functional-logic deductive databases. This calculus is based on rst-order logic and handles relation predicates, equalities and inequalities over partially de ned terms, and approximation equations. Jesús M. Almendros-Jiménez; Antonio Becerra-Terón http://biblioteca.universia.net/ficha.do?id=42004024 The procedural semantics of multi-adjoint logic programming is used for providing a model-theoretic semantics for a data model. S. Krajci,M. Ojeda-aciego,P. Vojtas http://biblioteca.universia.net/ficha.do?id=45788278 Abstract In this paper, we present an extended relational calculus for expressing queries in functional-logic deductive databases. This calculus is based on first-order logic and handles relation predicates, equalities and inequalities over partially defined terms, and approximation equations. For the calculus formulas, we have studied syntactic conditions in order to ensure the domain independence property. Finally, we have studied its equivalence w.r.t. the original query language, which is... http://biblioteca.universia.net/ficha.do?id=45813394 In this paper, we present an extended relational calculus for expressing queries in functional-logic deductive databases. This calculus is based on first-order logic and handles relation predicates, equalities and inequalities over partially defined terms, and approximation equations. For the calculus formulas, we have studied syntactic conditions in order to ensure the domain independence property. Finally, we have studied its equivalence w.r.t. the original query language, which is based on... Jesús M. Almendros-jiménez; Antonio Becerra-terón http://biblioteca.universia.net/ficha.do?id=41805778 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... Piero Fraternali,Ulrich Geske,Carolina Ruiz,Dietmar Seipel (eds,Forschungszentrum Informationstechnik Gmbh,Schlo Birlinghoven http://biblioteca.universia.net/ficha.do?id=41466062 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... Mukesh Dalal,Dipayan Gangopadhyay