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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of automated reasoning Ročník 68; číslo 4; s. 23
Hlavní autori:	Cristiá, Maximiliano, Rossi, Gianfranco
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Dordrecht Springer Netherlands 01.12.2024 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!