A resolution principle for a logic with restricted quantifiers

zbMATH Open0985.03517MaRDI QIDQ1596540FDOQ1596540

Hans-Jürgen Bürckert

Publication date: 22 May 2002

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• A resolution principle for constrained logics
• scientific article; zbMATH DE number 1507192
• scientific article; zbMATH DE number 7680806
• On Skolemization in constrained logics
• Publication:4503913

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Mechanization of proofs and logical operations (03B35)

Cited In (18)

• Strict coherence of conditional rewriting modulo axioms
• A typed resolution principle for deduction with conditional typing theory
• Combination of constraint solving techniques: An algebraic point of view
• Theorem proving in cancellative abelian monoids (extended abstract)
• Resolution principles in possibilistic logic
• Strategies of the search for derivation of statements with restricted quantifiers
• Title not available (Why is that?)
• On the complexity of Boolean unification
• Programming in metric temporal logic
• Refutational theorem proving for hierarchic first-order theories
• Combination of constraint solvers for free and quasi-free structures
• A hybrid reasoning system for terminologies and first-order clauses in knowledge bases
• A practical integration of first-order reasoning and decision procedures
• Title not available (Why is that?)
• A resolution principle for constrained logics
• Theorem proving modulo
• Title not available (Why is that?)
• Linear and unit-resulting refutations for Horn theories

This page was built for publication: A resolution principle for a logic with restricted quantifiers

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