A Practical Decision Procedure for Quantifier-Free, Decidable Languages Extended with Restricted Quantifiers

Let L X be the language of a first-order, decidable, quantifier-free theory X . Consider the language, L R Q ( X ) , that extends L X with formulas of the form ∀ x ∈ A : ϕ (restricted universal quantifier, RUQ) and ∃ x ∈ A : ϕ (restricted existential quantifier, REQ), where A is a finite set and ϕ i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of automated reasoning Jg. 68; H. 4; S. 23
Hauptverfasser: Cristiá, Maximiliano, Rossi, Gianfranco
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Dordrecht Springer Netherlands 01.12.2024
Springer Nature B.V
Schlagworte:
Artificial Intelligence
Case studies
Computer Science
Language
Logic programming
Mathematical Logic and Formal Languages
Mathematical Logic and Foundations
Semantics
Symbolic and Algebraic Manipulation
Syntax
Theory X
Variables
Set theory
Constraint logic programming
Restricted quantifiers
ISSN:0168-7433, 1573-0670
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Let L X be the language of a first-order, decidable, quantifier-free theory X . Consider the language, L R Q ( X ) , that extends L X with formulas of the form ∀ x ∈ A : ϕ (restricted universal quantifier, RUQ) and ∃ x ∈ A : ϕ (restricted existential quantifier, REQ), where A is a finite set and ϕ is a formula made of X -formulas, RUQ and REQ. That is, L R Q ( X ) admits nested restricted quantifiers. In this paper we present a decision procedure for some expressive fragments of L R Q ( X ) and its implementation as part of the { l o g } (‘setlog’) tool. The usefulness of the approach is shown by reporting on three real-world case studies.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0168-7433
1573-0670
DOI:10.1007/s10817-024-09713-6