Computing with first-order logic

DOI10.1006/JCSS.1995.1025MaRDI QIDQ1892224zbMATH OpenOpenAlexWikidataFDO

Authors Serge Abiteboul, Victor Vianu

Publication date 17 December 1995

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/407090b8f18ca3af6b73e74c2b9e616aa0af7b91

zbMATH Keywords

database query languagesfirst-order logic

Mathematics Subject Classification ID

Theory of programming languages (68N15) Database theory (68P15)

Recommendations

• Computing with infinitary logic
• Fixpoint logics, relational machines, and computational complexity
• The expressive power of fixed-point logic with counting
• Relational queries computable in polynomial time
• Computational model theory: an overview

Cited in

(25)

• Reflective relational machines
• A restricted second order logic for finite structures
• Semantics and expressiveness issues in active databases
• Temporal connectives versus explicit timestamps to query temporal databases
• How to define a linear order on finite models
• Querying spatial databases via topological invariants
• Adding for-loops to first-order logic
• On the decidability of the termination problem of active database systems
• Linear ordering on graphs, anti-founded sets and polynomial time computability
• Highly expressive query languages for unordered data trees
• On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry
• A NORMAL FORM FOR FIRST-ORDER LOGIC OVER DOUBLY-LINKED DATA STRUCTURES
• The Descriptive Complexity of Parity Games
• Super/rosy L^k-theories and classes of finite structures
• scientific article; zbMATH DE number 1302496 (Why is no real title available?)
• scientific article; zbMATH DE number 1086662 (Why is no real title available?)
• Fixpoint logics, relational machines, and computational complexity
• Computing on structures
• Computable queries for object oriented databases
• Some Turing-complete extensions of first-order logic
• The Relational Polynomial-Time Hierarchy and Second-Order Logic
• A constant-space sequential model of computation for first-order logic
• Semiring reasoning frameworks in AI and their computational complexity
• First order logic, fixed point logic and linear order
• Computing with infinitary logic

This page was built for publication: Computing with first-order logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892224)