The query topology in logic programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 810107
- scientific article; zbMATH DE number 3936480
- scientific article; zbMATH DE number 4057054
- scientific article; zbMATH DE number 559225
- Graph traversal and top-down evaluation of logic queries
- Publication:4204135
- scientific article; zbMATH DE number 4090844
- Computing queries with higher-order logics
- A query language for logic architectures
Cites work
- scientific article; zbMATH DE number 3112450 (Why is no real title available?)
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 3706504 (Why is no real title available?)
- scientific article; zbMATH DE number 3479762 (Why is no real title available?)
- scientific article; zbMATH DE number 4123705 (Why is no real title available?)
- scientific article; zbMATH DE number 3255438 (Why is no real title available?)
- Canonical logic programs
- Commuting Mappings and Fixed Points
- Invariant sets in topology and logic
- Model theory of topological structures
- Some consequences of the normality of the space of models
- Topological model theory
Cited in
(6)- scientific article; zbMATH DE number 810107 (Why is no real title available?)
- On first-order topological queries
- Logic programs, iterated function systems, and recurrent radial basis function networks
- scientific article; zbMATH DE number 4123705 (Why is no real title available?)
- Topological investigations of the operators of the well-founded, and alternating fixed-point semantics of normal logic programs
- A topological characterization of (,)^*-compactness
This page was built for publication: The query topology in logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096171)