Results 291 to 300 of about 165,831 (331)

Logic Fragments: Coordinating Entities with Logic Programs

2016
Rigorous engineering of self-organising and self-adaptive systems is a challenging activity. Interactions with humans and unexpected entities, dependence on contextual information for self-organisation and adaptation represent just some of the factors complicating the coordination process among multiple entities of the system.
De Angelis, Francesco, Di Marzo Serugendo, Giovanna   +1 more
openaire   +2 more sources

Fragments of first order logic, I: universal Horn logic

Journal of Symbolic Logic, 1977
Let L be any finitary language. By restricting our attention to the universal Horn sentences of L and appealing to a semantical notion of logical consequence, we can formulate the universal Horn logic of L. The present paper provides some theorems about universal Horn logic that serve to distinguish it from the full first order predicate logic ...
openaire   +2 more sources

Quantum Logic as a Fragment of Independence-Friendly Logic

Journal of Philosophical Logic, 2002
The author presents his hypothesis that noncommuting variables are irreducibly interdependent in the logic connected with the foundations of quantum mechanics. The logic of such dependence relations is presented as independence-friendly logic, previously introduced by the author, which uses a sentence-initial contradictory negation over and above the ...
openaire   +1 more source

A Fragment of Intuitionistic Dynamic Logic

Fundamenta Informaticae, 2001
We present a fragment of Propositional Dynamic Logic based on the Intuitionistic Propositional Logic. We show that this logic has the finite model property, and therefore, is frame-complete.
openaire   +2 more sources

Fragments of First-Order Logic

2023
AbstractA sentence of first-order logic is satisfiable if it is true in some structure, and finitely satisfiable if it is true in some finite structure. For which fragments of first-order logic is there an effective method for determining satisfiability or finite satisfiability?
openaire   +2 more sources

Fragments of Default Logic

1989
In the previous chapter we furnished some insight in the use of fragments of default logic as delineated by the format of defaults they admit. The present chapter is devoted to the formal development of these fragments, including open problems.
openaire   +1 more source

On fragments of Medvedev's logic

Studia Logica, 1981
Medvedev's intermediate logic (MV) can be defined by means of Kripke semantics as the family of Kripke frames given by finite Boolean algebras without units as partially ordered sets. The aim of this paper is to present a proof of the theorem: For every set of connectivesΦ such that\(\{ \to , \vee , \urcorner \} \not \subseteq \Phi \subseteq \{ \to ...
openaire   +2 more sources

Belief Contraction Within Fragments of Propositional Logic

2016
Recently, belief change within the framework of fragments of propositional logic has gained attention. In the context of revision it has been proposed to refine existing operators so that they operate within propositional fragments, and that the result of revision remains in the fragment under consideration.
Creignou, Nadia, Ktari, Raïda, Papini, Odile   +2 more
openaire   +2 more sources

A correspondence between implicational fragment logics and fuzzy logics

2014 IEEE International Conference on Granular Computing (GrC), 2014
This research report treats a correspondence between implicational fragment logics and fuzzy logics from the viewpoint of their algebraic semantics. The authors introduce monotone BI-algebras by loosening the axiomatic system of BCK-algebras. Also, we extend the algebras of fuzzy logics with weakly-associative conjunction from the case of the unit real
Mayuka F. Kawaguchi, Michiro Kondo
openaire   +1 more source

Modal Logic and the Two-Variable Fragment

2001
We introduce a modal language L which is obtained from standard modal logic by adding the difference operator and modal operators interpreted by boolean combinations and the converse of accessibility relations. It is proved that L has the same expressive power as the two-variable fragment FO^2 of first-order logic but speaks less succinctly about ...
Lutz, C, Sattler, U, Wolter, F
openaire   +2 more sources