Compiling dyadic first-order specifications into map algebra

DOI10.1016/S0304-3975(01)00355-3zbMath1025.68053OpenAlexW1986995658MaRDI QIDQ1870581

Andrea Formisano, Calogero G. Zarba, Eugenio Giovanni Omodeo, Domenico Cantone

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00355-3

zbMATH Keywords

computational complexityquantifier eliminationalgebraic logic

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (7)

A graphical representation of relational formulae with complementation ⋮ Three-variable statements of set-pairing ⋮ Reasoning with Graphs ⋮ An Agg Application Supporting Visual Reasoning1 ⋮ Layered map reasoning ⋮ On graph reasoning ⋮ An efficient relational deductive system for propositional non-classical logics

Uses Software

• AGG
• Datalog

Cites Work

• Introduction to axiomatic set theory
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• An Agg Application Supporting Visual Reasoning1
• Layered map reasoning
• Handbook of Graph Grammars and Computing by Graph Transformation
• Goals and benchmarks for automated map reasoning
• Decidability of the theory of the natural integers with the Cantor pairing function and the successor
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compiling dyadic first-order specifications into map algebra