In this paper, we discourse an analysis of classical first-order predicate logic as a constraint satisfaction problem, CSP. First, will offer our general framework for CSPs, and then apply it to logic. We claim would function new semantics, Then, prove the soundness completeness theorems with respect semantics. The latter theorem, which be proven by proof-search method, implies cut-elimination ...

It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<,+1]) in the pointwise semantics over bounded time domains (i.e., timed words of bounded duration) [2]. In this paper, we present an extension of MTL, relying on two new temporal operators ‘Earlier’ (E) and ‘Newer’ (N), which has the same expressive power as FO[<,...

Every definite logic program has as its meaning a least Herbrand model with respect to the program-independent ordering ⊆. In the case of normal logic programs there do not exist least models in general. However, according to a recent approach by Rondogiannis and Wadge, who consider infinite-valued models, every normal logic program does have a least model with respect to a program-independent ...

Using non-deterministic structures called Nmatrices, we provide simple modular non-deterministic semantics for a large family of first-order paraconsistent logics with a formal consistency operator, also known as LFIs. This includes da-Costa’s well known predicate calculus C∗ 1 . We show how consistency propagation in quantified formulas is captured in the semantic framework of Nmatrices, and a...

This paper investigates the formalization of independence in logic, in particular between quantifiers. We first illustrate that this form of independence plays a role in many fields. A logic that has the possibility to express such a form of independence is Independence Friendly logic (introduced by Hintikka); its semantics is defined by means of strategies in a sequential game. It will be show...

We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the characteristics of intuitionistic logic. Our calculus is based on a clausal matrix characterisation for intuitionistic logic, which we prove correct and complete. The calculus was implemented by extending the classical prover leanCoP. We ...