On Skolemization in constrained logics
type: Item
instance of: scholarly article
title: On Skolemization in constrained logics
zbMATH Open document ID: 0887.03005
DOI: 10.1007/BF02127744
author: Hans-Jürgen Bürckert
author: Bernhard Hollunder
author: Armin Laux
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1998-05-17T00:00:00Z
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03B10
zbMATH DE Number: 1123682
zbMATH Keywords: constrained logics
zbMATH Keywords: first-order logic
zbMATH Keywords: restricted quantifiers
zbMATH Keywords: satisfiability
zbMATH Keywords: Skolemization
zbMATH Keywords: constrained resolution principle
MaRDI profile type: Publication
cites work: An algebraic semantics approach to the effective resolution of type equations
cites work: Login: a logic programming language with built-in inheritance
cites work: An order-sorted logic for knowledge representation systems
cites work: A resolution principle for constrained logics
cites work: Q5679729
cites work: Q4264728
cites work: Q3996619
cites work: Q3495342
cites work: The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
cites work: Q4287499
cites work: Q3789107
cites work: Q3339245
cites work: Investigations in many-sorted quantor logic
cites work: Q5678447
cites work: Q5624683
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Die Zulässigkeit der Behandlung mehrsortiger Theorien mittels der üblichen einsortigen Prädikatenlogik
cites work: Computational aspects of an order-sorted logic with term declarations
cites work: Automated deduction by theory resolution
cites work: Q3992821
cites work: Q4261067
description: scientific article; zbMATH DE number 1123682