A resolution principle for constrained logics

DOI10.1016/0004-3702(94)90027-2zbMath0807.68082OpenAlexW1972550579MaRDI QIDQ1327159

Hans-Jürgen Bürckert

Publication date: 15 June 1994

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(94)90027-2

zbMATH Keywords

constrained logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (8)

On Skolemization in constrained logics ⋮ Knowledge-based proof planning ⋮ Connection calculus theorem proving with multiple built-in theories ⋮ A hybrid reasoning system for terminologies and first-order clauses in knowledge bases ⋮ Constraint solving for proof planning ⋮ Combining Horn rules and description logics in CARIN ⋮ Verification from Declarative Specifications Using Logic Programming ⋮ Unions of non-disjoint theories and combinations of satisfiability procedures

Uses Software

• CHIP

Cites Work

• Investigations in many-sorted quantor logic
• Link inheritance in abstract clause graphs
• The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
• Reasoning and revision in hybrid representation systems
• An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
• A resolution principle for a logic with restricted quantifiers
• Computational aspects of an order-sorted logic with term declarations
• Automated deduction by theory resolution
• A theory of restricted quantification I
• Unification: a multidisciplinary survey
• Another Generalization of Resolution
• A Machine-Oriented Logic Based on the Resolution Principle
• Equality, types, modules, and (why not?) generics for logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A resolution principle for constrained logics