Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Deductive databases --- Object-oriented databases --- Congresses --- Congresses. --- Deductive databases - Congresses --- Object-oriented databases - Congresses

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book stands at the intersection of two topics: the decidability and computational complexity of hybrid logics, and the deductive systems designed for them. Hybrid logics are here divided into two groups: standard hybrid logics involving nominals as expressions of a separate sort, and non-standard hybrid logics, which do not involve nominals but whose expressive power matches the expressive power of binder-free standard hybrid logics.The original results of this book are split into two parts. This division reflects the division of the book itself. The first type of results concern model-theoretic and complexity properties of hybrid logics. Since hybrid logics which we call standard are quite well investigated, the efforts focused on hybrid logics referred to as non-standard in this book. Non-standard hybrid logics are understood as modal logics with global counting operators (M(En)) whose expressive power matches the expressive power of binder-free standard hybrid logics. The relevant results comprise:1. Establishing a sound and complete axiomatization for the modal logic K with global counting operators (MK(En)), which can be easily extended onto other frame classes,2. Establishing tight complexity bounds, namely NExpTime-completeness for the modal logic with global counting operators defined over the classes of arbitrary, reflexive, symmetric, serial and transitive frames (MK(En)), MT(En)), MD(En)), MB(En)), MK4(En)) with numerical subscripts coded in binary. Establishing the exponential-size model property for this logic defined over the classes of Euclidean and equivalential frames (MK5(En)), MS5(En)).Results of the second type consist of designing concrete deductive (tableau and sequent) systems for standard and non-standard hybrid logics. More precisely, they include:1. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for a rich class of binder-free standard hybrid logics. An interesting feature of indicated calculi is the nonbranching character of the rule (¬D),2. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for non-standard hybrid logics. The internalization technique applied to a tableau calculus for the modal logic with global counting operators is novel in the literature,3. Devising the first hybrid algorithm involving an inequality solver for modal logics with global counting operators. Transferring the arithmetical part of reasoning to an inequality solver turned out to be sufficient in ensuring termination.The book is directed to philosophers and logicians working with modal and hybrid logics, as well as to computer scientists interested in deductive systems and decision procedures for logics. Extensive fragments of the first part of the book can also serve as an introduction to hybrid logics for wider audience interested in logic.The content of the book is situated in the areas of formal logic and theoretical computer science with some elements of the theory of computational complexity.

Proof theory. --- Logic, Symbolic and mathematical. --- Deductive databases. --- Deductive data bases --- Databases --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Logic, Symbolic and mathematical

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book describes recent multidisciplinary research at the confluence of the fields of logic programming, database theory and human-computer interaction. The goal of this effort was to develop the basis of a deductive spreadsheet, a user productivity application that allows users without formal training in computer science to make decisions about generic data in the same simple way they currently use spreadsheets to make decisions about numerical data. The result is an elegant design supported by the most recent developments in the above disciplines. The first half of the book focuses on the deductive engine that underlies this application, the foundations that users do not see. After giving a mathematical model of traditional spreadsheet applications, we extend them with operators to perform a number of relational tasks, similar to the user view of a database but in a spreadsheet context. Expressing this extension in a logic programming framework is a natural step towards giving it powerful deductive capabilities. The second half of the book deals with the user interface, the part of the application with which the user actually interacts. We review the elements of the graphical user interface of traditional spreadsheet applications and describe practical methodologies for designing user interfaces borrowed from the field of cognitive psychology. We then propose a design that conservatively integrates mechanisms for a user to take advantage of the new deductive capabilities. This is followed by the results of some preliminary usability experiments. The book will appeal to researchers and practitioners in the various areas underlying this work. Researchers will not only find interesting new developments in their domains, but will also learn how to achieve a multidisciplinary focus. Practitioners will find fully developed solutions to numerous problems that are not easily solvable using traditional spreadsheet applications.

Office management --- Computer science --- Programming --- Information systems --- Artificial intelligence. Robotics. Simulation. Graphics --- Computer. Automation --- ICT (informatie- en communicatietechnieken) --- bedrijfseconomie --- computers --- informatica --- bedrijfsadministratie --- programmeren (informatica) --- informatiesystemen --- KI (kunstmatige intelligentie) --- informatica management --- computerkunde --- robots --- AI (artificiële intelligentie) --- Electronic spreadsheets. --- Deductive databases. --- Logic programming.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Information systems --- Deductive databases --- Logic programming --- Bases de données déductives --- Programmation logique --- 681.3*H2 --- 681.3*I23 --- Computer programming --- Deductive data bases --- Databases --- Database management: security; integrity; protection--See also {?681.5*E5} --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*H2 Database management: security; integrity; protection--See also {?681.5*E5} --- Bases de données déductives

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The development of database technology has currently reached the stage of deductive database systems which use Horn clauses for defining relations. An important characteristic of these systems is the clear separation of logic and control. However, the programmer cannot affect the control part of a deductive database system. To eliminate this deficiency, this monograph presents a so-called expert deductive database system that allows explicit control of the deduction process. The system consists of an object-level describing the logical aspects of a problem and of a meta-level that contains application-specific control information affecting the object-level deduction process. For example, object-level rules can be disregarded, and some tuples deduced at the object-level can be preferred to others. Besides the architecture of this system, the book also identifies some important possibilities of deduction control which are explained by characteristic examples.

Banques de données--Gestion --- Bases de données déductives --- Data base management --- Database management --- Databasebeheer --- Databases--Beheer --- Deductieve data bases --- Deductive data bases --- Deductive databases --- Gegevensbanken--Beheer --- Gegevensbestanden--Beheer --- Generalized data management systems --- Systems [Data base management ] --- Systems [Generalized data base management ] --- 681.3*H28 --- 681.3*H23 --- 681.3*H24 --- Database applications --- Languages: data description languages; DDL; data manupulation languages; DML;query languages; report writers (Database management) --- Systems: concurrency; distributed systems; query processing; transaction processing (Database management) --- Database management. --- Deductive databases. --- 681.3*H24 Systems: concurrency; distributed systems; query processing; transaction processing (Database management) --- 681.3*H23 Languages: data description languages; DDL; data manupulation languages; DML;query languages; report writers (Database management) --- 681.3*H28 Database applications --- Databases --- Data services (Database management) --- Database management services --- DBMS (Computer science) --- Services, Database management --- Systems, Database management --- Systems, Generalized database management --- Electronic data processing --- Data structures (Computer scienc. --- Artificial intelligence. --- Data Structures and Information Theory. --- Database Management. --- Artificial Intelligence. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers