Filters








45,310 Hits in 4.3 sec

Logic Based Merging

Sébastien Konieczny, Ramón Pino Pérez
2011 Journal of Philosophical Logic  
Belief merging aims at combining several pieces of information coming from different sources. In this paper we review the works on belief merging of propositional bases.  ...  Finally we mention the main generalizations of these works in other logical frameworks.  ...  Acknowledgements The authors would like to thank the reviewers and Jérôme Lang for their remarks which have greatly contributed to improve the paper.  ... 
doi:10.1007/s10992-011-9175-5 fatcat:ntje45ahdbcpniinhemtzcdrli

A finite equational base for CCS with left merge and communication merge

Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, Bas Luttik
2009 ACM Transactions on Computational Logic  
His axiom schemata also generate an equational base provided that the set of actions is infinite.  ...  Using the left merge and communication merge from ACP, we present an equational base for the fragment of CCS without restriction and relabelling.  ...  Clearly, P γ has EqTh(P γ ) as an equational base, but it is infinite, and offers little insight into the nature of the equations valid in P γ .  ... 
doi:10.1145/1459010.1459016 fatcat:rzjirsjuije7xiutgc7ni2hkwy

Merging Process Algebra and Action-based Computation Tree Logic [article]

Zhaohui Zhu, Yan Zhang, Jinjin Zhang
2012 arXiv   pre-print
Moreover, the links between this calculus and Action-based Computation Tree Logic (ACTL) including characteristic formulae of process terms, characteristic processes of ACTL formulae and Galois connection  ...  In order to mix algebraic and logic styles of specification in a uniform framework, the notion of a logic labelled transition system (LLTS) has been presented and explored by Luttgen and Vogler.  ...  We will prove item (1)-(4) simultaneously by induction on the depth of ℑ. The argument splits into five cases based on the format of u. Case 1 u ≡ p̟q.  ... 
arXiv:1212.6813v1 fatcat:aunccxsieje3thqrcpqilgn2y4

Merging Uncertain Knowledge Bases in a Possibilistic Logic Framework [article]

Salem Benferhat, Claudio Sossai
2013 arXiv   pre-print
This paper addresses the problem of merging uncertain information in the framework of possibilistic logic.  ...  It presents several syntactic combination rules to merge possibilistic knowledge bases, provided by different sources, into a new possibilistic knowledge base.  ...  that SPL (standard possibilistic logic) can be merged inside LPL.  ... 
arXiv:1301.7359v1 fatcat:q4drgmj2cjffnbetw5m5pxrgpm

Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases

Salem Benferhat, Souhila Kaci
2003 Artificial Intelligence  
In the second part of the paper, we show that distance-based merging propositional knowledge bases can be naturally encoded using ∆-knowledge bases.  ...  Moreover, this encoding is more efficient than the necessitybased encoding of distance-based merging operator.  ...  the paper [17] .  ... 
doi:10.1016/s0004-3702(03)00025-0 fatcat:nglv64iqkverjj5hxe6pfop2na

Compactness in semantics for merge and fair merge [chapter]

J. W. Bakker, J. I. Zucker
1984 Lecture Notes in Computer Science  
and merge, and of the definition of fair merge based on an appropriate alternation of random choices.  ...  This is no longer the case for an infinite alphabet A.  ...  Throughout, we distinguish the finite case (p,q € P ) and infinite case (p € P\P or w w q € P\P ).  ... 
doi:10.1007/3-540-12896-4_352 fatcat:qevbfvw5zra45gyls3xbnx6bla

Logic-Based Probabilistic Modeling [chapter]

Taisuke Sato
2009 Lecture Notes in Computer Science  
After briefly mentioning the historical background of PLL/SRL, we examine PRISM, a logic-based modeling language, as an instance of PLL/SRL research.  ...  We first look at the distribution semantics, PRISM's semantics, which defines a probability measure on a set of possible Herbrand models.  ...  In such a case a purely logical inference would completely get stuck as we do not know the truth value of W .  ... 
doi:10.1007/978-3-642-02261-6_6 fatcat:ot3lr2azfvgllix4go3j3jh2py

Sampling-based temporal logic path planning

Cristian Ioan Vasile, Calin Belta
2013 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems  
In this paper, we propose a sampling-based motion planning algorithm that finds an infinite path satisfying a Linear Temporal Logic (LTL) formula over a set of properties satisfied by some regions in a  ...  Examples illustrating the usefulness and the performance of the method are included.  ...  The One of the solutions corresponding to Case Study 1: the specification is to visit all the colored regions labelled r1 (yellow), r2 (green), r3 (blue) and r4 (cyan) infinitely often, while avoiding  ... 
doi:10.1109/iros.2013.6697051 dblp:conf/iros/VasileB13 fatcat:zdwxpdq5zzgv5ndh6i6w7o6kry

Organising Logic-Based Agents [chapter]

Michael Fisher, Chiara Ghidini, Benjamin Hirsch
2003 Lecture Notes in Computer Science  
We base our approach on a logical model of rational agency comprising a few simple, but powerful, concepts.  ...  While many other researchers have tackled this problem using formal logic, the important aspect of the work described here is that the logical descriptions of the agents are directly executable using the  ...  The semantics of the temporal part of the logic is defined in the standard way via the satisfiability relation on a discrete linear temporal model of time, m, with finite past and infinite future [4]  ... 
doi:10.1007/978-3-540-45133-4_2 fatcat:m54d2yrgx5cyraekprexynva4e

Sampling-Based Temporal Logic Path Planning [article]

Cristian Ioan Vasile, Calin Belta
2013 arXiv   pre-print
In this paper, we propose a sampling-based motion planning algorithm that finds an infinite path satisfying a Linear Temporal Logic (LTL) formula over a set of properties satisfied by some regions in a  ...  Examples illustrating the usefulness and the performance of the method are included.  ...  One of the solutions corresponding to Case Study 1: the specification is to visit all the colored regions labelled r1 (yellow), r2 (green), r3 (blue) and r4 (cyan) infinitely often, while avoiding the  ... 
arXiv:1307.7263v1 fatcat:qpvzibcyh5fmlekp5smg2v6gay

Merge Is Not Recursion

Ramón Casares
2017 Figshare  
, that syntax is just Merge, cannot be translated sensibly to computing, because Merge by itself cannot even parse, and therefore it is not enough to explain the evolution of Merge to explain the evolution  ...  The main conclusions are: that the book uses the word "recursion" with a meaning that does not correspond to the meaning used in mathematics, causing confusion, and that the theory proposed in the book  ...  the members of the base set.  ... 
doi:10.6084/m9.figshare.4958822.v1 fatcat:azo7sp4yt5gddcr6lay4tx574i

Description Logic Knowledge Base Exchange [chapter]

Elena Botoeva
2012 Lecture Notes in Computer Science  
of knowledge base exchange in a Description Logic setting.  ...  To investigate the problem of translating the knowledge in the source knowledge base according to the mapping, we define a general framework of description logic knowledge base exchange and specialize  ...  Then it must be the case α is of the form S Q and T 12 |= R S for some role S over Σ 2 .  ... 
doi:10.1007/978-3-642-33203-6_30 fatcat:vcs2m4p6rjadpcuj63hwacwocq

Merge Is Not Recursion

Ramón Casares
2017 Figshare  
, that syntax can be reduced to Merge, does not translate sensibly to computing, because Merge by itself cannot even parse, and therefore it is not enough to explain the evolution of Merge to explain the  ...  The main conclusions are: that the book uses the word "recursion" with a meaning that does not correspond to the meaning used in mathematics, causing confusion, and that the theory presented in the book  ...  on the members of the base set.  ... 
doi:10.6084/m9.figshare.4958822.v2 fatcat:kkbtgxgslrbvlbadv6dyuewmjy

Merging Frameworks for Interaction

Johan van Benthem, Jelle Gerbrandy, Tomohiro Hoshi, Eric Pacuit
2009 Journal of Philosophical Logic  
The second framework is Dynamic Epistemic Logic (DEL) that describes interactive processes in terms of epistemic event models which may occur inside modalities of the language.  ...  One contribution is an axiomatization for the dynamic logic of public announcements constrained by protocols, which has been an open problem for some years, as it does not fit the usual 'reduction axiom  ...  Proof We show by induction on the structure of ϕ ∈ L PAL that for each h ∈ H can , ϕ ∈ λ(h) iff H can , h |= ϕ. The base and the boolean cases are straightforward.  ... 
doi:10.1007/s10992-008-9099-x fatcat:zmhexqliizf6nba7rskp5tglym

Constructor-based observational logic

Michel Bidoit, Rolf Hennicker
2006 The Journal of Logic and Algebraic Programming  
This paper focuses on the integration of reachability and observability concepts within an algebraic, institution-based framework.  ...  The satisfaction relation is the usual satisfaction relation of first-order logic with equality.  ...  If the set OP Obs of observers is empty, then all sorts are observable sorts. This is the special case considered in the constructor-based logic institution [8] .  ... 
doi:10.1016/j.jlap.2005.09.002 fatcat:lmuokma5yzdfljbcjsio7hj5ce
« Previous Showing results 1 — 15 out of 45,310 results