Goals and benchmarks for automated map reasoning
From MaRDI portal
Recommendations
Cites work
- \(T\)-resolution: Refinements and model elimination
- T-theorem proving. I
- A Finite Axiomatization for Fork Algebras
- A logic for rough sets
- Baltic computer science. Selected papers
- Computer proofs in Gödel's class theory with equational definitions for composite and cross
- Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
- Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
- Embedding Boolean expressions into logic programming
- Expressing infinity without foundation
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 3976287 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 50150 (Why is no real title available?)
- scientific article; zbMATH DE number 67019 (Why is no real title available?)
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 234018 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- scientific article; zbMATH DE number 3304881 (Why is no real title available?)
- scientific article; zbMATH DE number 3351504 (Why is no real title available?)
- scientific article; zbMATH DE number 3068569 (Why is no real title available?)
- scientific article; zbMATH DE number 3070503 (Why is no real title available?)
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
- On the Decision Problem for Two-Variable First-Order Logic
- On the relative expressiveness of description logics and predicate logics
- Problem corner: Robbins algebra: Conditions that make a near-Boolean algebra Boolean
- Program derivation with verified transformations — a case study
- Rapid construction of algebraic axioms from samples
- Relation algebras: Concept of points and representability
- Set theory for verification. II: Induction and recursion
- Solution of the Robbins problem
- The automation of syllogistic. II: Optimization and complexity issues
- The origin of relation algebras in the development and axiomatization of the calculus of relations
- The representation of relational algebras
Cited in
(9)- Compiling dyadic first-order specifications into map algebra
- ER modelling from first relational principles
- Three-variable statements of set-pairing
- A graphical representation of relational formulae with complementation
- scientific article; zbMATH DE number 1953886 (Why is no real title available?)
- An \textsc{Agg} application supporting visual reasoning
- Layered map reasoning: an experimental approach put to trial on sets
- Contextual building typification in automated map generalization
- Reasoning on relations, modalities, and sets
This page was built for publication: Goals and benchmarks for automated map reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5927984)
