The Specialization of Programs by Theorem Proving
From MaRDI portal
Publication:5652222
Cited in
(32)- A kind of logical compilation for knowledge bases
- A new combination of input and unit deductions for Horn sentences
- Maslov's inverse method and decidable classes
- Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\)
- Subsumption and implication
- Modelling the combination of functional and logic programming languages
- Unfold/fold transformations for disjunctive logic programs
- Computing minimal models by partial instantiation
- Fuzzy logic programming
- A sound and complete query evaluation for implicit predicate which is a semantic descriptor of unknown values
- Problem representations and formal properties of heuristic search
- Dynamic backward reasoning systems
- Using rewriting rules for connection graphs to prove theorems
- A logic for programming with complex objects
- Semantics and properties of existential quantifiers in deductive databases
- A parallel approach for theorem proving in propositional logic
- Resolution-based approach to compatibility analysis of interacting automata
- A Prolog technology theorem prover: A new exposition and implementation in Prolog
- A fixpoint semantics of Horn sentences based on substitution sets
- \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)
- Using the tree representation of terms to recognize matching with neural networks
- Recursive query processing: The power of logic
- Minimalism, justification and non-monotonicity in deductive databases
- Type data bases with incomplete information
- Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic
- A new fuzzy resolution principle based on the antonym
- Complexity of resolution proofs and function introduction
- The \(Q^*\) algorithm - a search strategy for a deductive question-answering system
- \(\Pi\)-representation: A clause representation for parallel search
- Fuzzy propositional logic
- On the complexity of cutting-plane proofs
- \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\)
This page was built for publication: The Specialization of Programs by Theorem Proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652222)
