A resolution principle for constrained logics

DOI10.1016/0004-3702(94)90027-2zbMATH Open0807.68082OpenAlexW1972550579MaRDI QIDQ1327159FDOQ1327159

Authors: 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

Recommendations

• scientific article; zbMATH DE number 7680806
• A resolution principle for a logic with restricted quantifiers
• Publication:4503913
• scientific article; zbMATH DE number 1761416
• On Skolemization in constrained logics

zbMATH Keywords

constrained logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

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

Cited In (22)

• A typed resolution principle for deduction with conditional typing theory
• Title not available (Why is that?)
• Verification from Declarative Specifications Using Logic Programming
• Title not available (Why is that?)
• Resolution principles in possibilistic logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear resolution for consequence finding
• Combining Horn rules and description logics in CARIN
• Title not available (Why is that?)
• Constraint solving for proof planning
• Knowledge-based proof planning
• A hybrid reasoning system for terminologies and first-order clauses in knowledge bases
• A resolution principle for a logic with restricted quantifiers
• Unions of non-disjoint theories and combinations of satisfiability procedures
• Replacing unification by constraint satisfaction to improve logic program expressiveness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Connection calculus theorem proving with multiple built-in theories
• Title not available (Why is that?)
• On Skolemization in constrained logics
• Title not available (Why is that?)

Uses Software

• CHIP

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

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