Results 11 to 20 of about 633,950 (258)
Concurrent weighted logic [PDF]
Journal of Logical and Algebraic Methods in Programming, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim G. Larsen +2 more
core +6 more sources
Weighted versus Probabilistic Logics [PDF]
, 2009 While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection with (temporal) logic and related verification algorithms. In this paper, we will identify weighted versions of MSO and CTL that generalize the classical logics and even other ...
Gastin, Paul, Bollig, Benedikt
openaire +3 more sources
A unifying survey on weighted logics and weighted automata [PDF]
Soft Computing, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gastin, Paul, Monmege, Benjamin
openaire +3 more sources
Institutional logics, blended and suspended [PDF]
, 2014 This paper examines how a new institution, a code of conduct, arises and develops over time. It shows how the process of debate airs competing logics, questions and fails to question assumptions taken for granted, and yet achieves a large degree of ...
Nordberg, Donald
core +6 more sources
Weighted Automata and Weighted Logics [PDF]
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Droste, Manfred, Gastin, Paul
openaire +5 more sources
Model Checking One-clock Priced Timed Automata [PDF]
Logical Methods in Computer Science, 2008 We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical ...
Patricia Bouyer +2 more
doaj +1 more source
Products of weighted logic programs [PDF]
Theory and Practice of Logic Programming, 2011 AbstractWeighted logic programming, a generalization of bottom-up logic programming, is a well-suited framework for specifying dynamic programming algorithms. In this setting, proofs correspond to the algorithm's output space, such as a path through a graph or a grammatical derivation, and are given a real-valued score (often interpreted as a ...
Shay B. Cohen +2 more
openaire +4 more sources
Spatial Logics for Bigraphs [PDF]
, 2005 Bigraphs are emerging as an interesting model for concurrent calculi, like CCS, pi-calculus, and Petri nets. Bigraphs are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections.
Conforti, G., Macedonio, D., Sassone, V.
core +2 more sources
Weighted automata and weighted logics with discounting
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manfred Droste, George Rahonis
openaire +5 more sources
Assessment of Ecological Power to Determine the Land Use in Agriculture: A case study of Qaleh Ganj County [PDF]
Pizhūhish/hā-yi Rūstāyī, 2019 Achieving sustainable development and using resources effectively and efficiently depends on a thorough and accurate knowledge of the available facilities and capabilities as well as the limitations that deter desirable situations.
Ahmad Haj Alizadeh +2 more
doaj +1 more source