scientific article; zbMATH DE number 3467028
From MaRDI portal
Publication:4052071
Cited in
(only showing first 100 items - show all)- Learning symmetric causal independence models
- Reasoning about knowledge of unawareness
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
- Combination of convex theories: modularity, deduction completeness, and explanation
- What's so logical about the logical axioms?
- Are mathematical theorems analytic or synthetic?
- Some questions about expressiveness and relative completeness in Hoare's logic
- A note on Presburger arithmetic with array segments, permutation and equality
- On observational equivalence and algebraic specification
- Multi-layer logic - a predicate logic including data structure as knowledge representation language
- On the computability of circumscription
- Learning by understanding analogies
- A logical framework for default reasoning
- The word and generator problems for lattices
- A satisfiability tester for non-clausal propositional calculus
- Minimalism, justification and non-monotonicity in deductive databases
- A rough logic formalism for fuzzy controllers: A hard and soft computing view
- A theory of implementation and refinement in timed Petri nets
- Quantifiers as modal operators
- Axiomatic data type specifications: A first order theory of linear lists
- Specifications, models, and implementations of data abstractions
- Number of quantifiers is better than number of tape cells
- Upper and lower bounds for first order expressibility
- An analysis of fixed-point queries on binary trees
- Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
- On a generalization of the Gallai-Sylvester theorem
- Algebraic logic for classical conjunction and disjunction
- Temporal theories as modularisation units for concurrent system specification
- Semantics and reasoning with free procedures
- Partial monotonicity and a new version of the Ramsey test
- Using the Hamiltonian path operator to capture NP
- Reasoning about model accuracy
- A logic for reasoning with inconsistent knowledge
- Games, equations and dot-depth two monoids
- Completing sort hierarchies
- The logic of constraint satisfaction
- A new method for undecidability proofs of first order theories
- Rational choice and polynomial measurement models
- On winning strategies in Ehrenfeucht-Fraïssé games
- An extension of fixpoint logic with a symmetry-based choice construct
- A constant-space sequential model of computation for first-order logic
- Prolog technology for default reasoning: proof theory and compilation techniques
- Sentences over integral domains and their computational complexities
- Non-cooperative games on hyperfinite Loeb spaces
- Complete geometric query languages
- The computational complexity of some problems of linear algebra
- Hybrid terms and sentences
- A simple type theory with partial functions and subtypes
- Unique complements and decompositions of database schemata
- IMPS: An interactive mathematical proof system
- Constructing specification morphisms
- On minimizing the \(\forall\)-\(\neg\) degree of a connective-free formula
- Hybrid reasoning using universal attachment
- Additive utility
- Formulation of linear problems and solution by a universal machine
- On the danger of half-truths
- Infinite systems of linear equations and mathematical logic
- On pushout consistency, modularity and interpolation for logical specifications
- The Kreisel length-of-proof problem
- The complexity of query evaluation in indefinite temporal constraint databases
- Finitely representable databases
- Queries with arithmetical constraints
- A rewriting approach to satisfiability procedures.
- Skolem functions of arithmetical sentences.
- The closure of monadic NP
- Definable utility in o-minimal structures.
- Querying temporal and spatial constraint networks in PTIME
- Path constraints in semistructured databases
- On the desirability of mechanizing calculational proofs
- The role of metalanguage in graded logical approaches
- Non-commutative first-order EQ-logics
- Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems
- On ultrafilter logic and special functions
- The knower paradox in the light of provability interpretations of modal logic
- Alternative shaper: a model for automatic design generation
- A technique for proving decidability of containment and equivalence of linear constraint queries
- An inductive method for inexact reasoning
- A logic for reasoning about probabilities
- A unification-theoretic method for investigating the \(k\)-provability problem
- Games, equations and the dot-depth hierarchy
- The theory of functional and subset dependencies over relational expressions
- Finite queries do not have effective syntax.
- A meaningful justification for the representational theory of measurement.
- Compiling dyadic first-order specifications into map algebra
- The data type variety of stack algebras
- Default reasoning by deductive planning
- Specification and verification of object-oriented programs using supertype abstraction
- Ockham's razor in interval identification
- A logical framework for evolving software systems
- On triangular norm-based propositional fuzzy logics
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- Decidability of fluted logic with identity
- Complexity and undecidability results for logic programming
- Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design
- In defense of logical universalism: taking issue with Jean van Heijenoort
- On arithmetical first-order theories allowing encoding and decoding of lists
- Proving theorems by reuse
- CompoSAT: specification-guided coverage for model finding
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- Removing algebraic data types from constrained Horn clauses using difference predicates
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4052071)
