Compiling dyadic first-order specifications into map algebra

Authors:
D. Cantone;A. Formisano;E. G. Omodeo;C. G. Zarba
Affiliations:
Dipartimento di Matematica e Informatica, Università di Catania, Viale A. Doria 6a, I-95125 Catania, Italy;Dipartimento di Matematica e Informatica, Università di Perugia, Italy;Dipartimento di Matematica Pura e Applicata, Università di L'Aquila, Italy;Dipartimento di Matematica e Informatica, Università di Catania, Viale A. Doria 6a, I-95125 Catania, Italy and Department of Computer Science, Stanford University
Venue:
Theoretical Computer Science - Algebraic methods in language processing
Year:
2003

Citing 12
Cited 4

Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption

Journal of Logic Programming
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Introduction to algorithms

Introduction to algorithms
Logic programming and databases

Logic programming and databases
Relations and graphs: discrete mathematics for computer scientists

Relations and graphs: discrete mathematics for computer scientists
Hilbert's tenth problem

Hilbert's tenth problem
The AGG approach: language and environment

Handbook of graph grammars and computing by graph transformation
Goals and benchmarks for automated map reasoning

Journal of Symbolic Computation - Special issue on advances in first-order theorem proving
Decidability of the theory of the natural integers with the cantor pairing function and the successor

Theoretical Computer Science
Automated Development of Fundamental Mathematical Theories

Automated Development of Fundamental Mathematical Theories
Fundamentals of Algebraic Specification I

Fundamentals of Algebraic Specification I
Instructing Equational Set-Reasoning with Otter

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning

Reasoning with Graphs

Electronic Notes in Theoretical Computer Science (ENTCS)
On graph reasoning

Information and Computation
A calculus for graphs with complement

Diagrams'10 Proceedings of the 6th international conference on Diagrammatic representation and inference
An environment for specifying properties of dyadic relations and reasoning about them II: relational presentation of non-classical logics

TARSKI'02-05 Proceedings of the 2006 international conference on Theory and Applications of Relational Structures as Knowledge Instruments - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two techniques are designed for eliminating quantifiers from an existentially quantified conjunction of dyadic literals, in terms of the operators o, ∩, and -1 of the Tarski-Chin-Givant formalism of relations. The use of such techniques is illustrated through increasingly challenging examples, and their algorithmic complexity is assessed.