Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Problems and Prospects of Geoaesthetics  [PDF]
Kwang Myung Kim
Open Journal of Philosophy (OJPP) , 2015, DOI: 10.4236/ojpp.2015.51001
Abstract: Geoaesthetics is the project of making aesthetic sense of nature through geological phenomena. The aesthetic appreciation of nature has recently become urgent because of the serious influence of the natural environment on human beings. The author’s geoaesthetical research is categorized into three problems: art in geology or geology in the arts as the close relationship between art and geology, geological cognition of nature and natural cognition in environmental aesthetics, and the geoaesthetical approach through works of art. Geologic forces and processes have become significant materials for aesthetic sensations. Based on the geoaesthetic perspective, the author explores the ultimate purpose of art as a return to natural order. It seems partly to be related to the ontological problem of art. Here we can feel earthly dynamics, universal calmness, and the contemplative atmosphere simultaneously.
On the Expressiveness of Joining  [PDF]
Thomas Given-Wilson,Axel Legay
Computer Science , 2015, DOI: 10.4204/EPTCS.189.9
Abstract: The expressiveness of communication primitives has been explored in a common framework based on the pi-calculus by considering four features: synchronism (asynchronous vs synchronous), arity (monadic vs polyadic data), communication medium (shared dataspaces vs channel-based), and pattern-matching (binding to a name vs testing name equality vs intensionality). Here another dimension coordination is considered that accounts for the number of processes required for an interaction to occur. Coordination generalises binary languages such as pi-calculus to joining languages that combine inputs such as the Join Calculus and general rendezvous calculus. By means of possibility/impossibility of encodings, this paper shows coordination is unrelated to the other features. That is, joining languages are more expressive than binary languages, and no combination of the other features can encode a joining language into a binary language. Further, joining is not able to encode any of the other features unless they could be encoded otherwise.
Quantified CTL: Expressiveness and Complexity  [PDF]
Fran?ois Laroussinie,Nicolas Markey
Computer Science , 2014, DOI: 10.2168/LMCS-10(4:17)2014
Abstract: While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics) and characterise the complexity of its model-checking and satisfiability problems, depending on the number of nested propositional quantifiers (showing that the structure semantics populates the polynomial hierarchy while the tree semantics populates the exponential hierarchy).
Relative Expressiveness of Defeasible Logics  [PDF]
Michael Maher
Computer Science , 2012,
Abstract: We address the relative expressiveness of defeasible logics in the framework DL. Relative expressiveness is formulated as the ability to simulate the reasoning of one logic within another logic. We show that such simulations must be modular, in the sense that they also work if applied only to part of a theory, in order to achieve a useful notion of relative expressiveness. We present simulations showing that logics in DL with and without the capability of team defeat are equally expressive. We also show that logics that handle ambiguity differently -- ambiguity blocking versus ambiguity propagating -- have distinct expressiveness, with neither able to simulate the other under a different formulation of expressiveness.
Expressiveness of Elementary Cellular Automata  [PDF]
Markus Redeker,Andrew Adamatzky,Genaro J. Martínez
Physics , 2012, DOI: 10.1142/S0129183113500101
Abstract: We investigate expressiveness, a parameter of one-dimensional cellular automata, in the context of simulated biological systems. The development of elementary cellular automata is interpreted in terms of biological systems, and biologically inspired parameters for biodiversity are applied to the configurations of cellular automata. This article contains a survey of the Elementary Cellular Automata in terms of their expressiveness and an evaluation whether expressiveness is a meaningful term in the context of simulated biology.
On the Expressiveness and Complexity of ATL  [PDF]
Francois Laroussinie,Nicolas Markey,Ghassan Oreiby
Computer Science , 2008, DOI: 10.2168/LMCS-4(2:7)2008
Abstract: ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions of agents in order to enforce a given property. In this paper, we first precisely characterize the complexity of ATL model-checking over Alternating Transition Systems and Concurrent Game Structures when the number of agents is not fixed. We prove that it is \Delta^P_2 - and \Delta^P_?_3-complete, depending on the underlying multi-agent model (ATS and CGS resp.). We also consider the same problems for some extensions of ATL. We then consider expressiveness issues. We show how ATS and CGS are related and provide translations between these models w.r.t. alternating bisimulation. We also prove that the standard definition of ATL (built on modalities "Next", "Always" and "Until") cannot express the duals of its modalities: it is necessary to explicitely add the modality "Release".
On the Expressiveness of Line Drawings  [PDF]
Harm Hollestelle
Computer Science , 2009,
Abstract: Can expressiveness of a drawing be traced with a computer? In this study a neural network (perceptron) and a support vector machine are used to classify line drawings. To do this the line drawings are attributed values according to a kinematic model and a diffusion model for the lines they consist of. The values for both models are related to looking times. Extreme values according to these models, that is both extremely short and extremely long looking times, are interpreted as indicating expressiveness. The results strongly indicate that expressiveness in this sense can be detected, at least with a neural network.
Expressiveness via Intensionality and Concurrency  [PDF]
Thomas Given-Wilson
Computer Science , 2014,
Abstract: Computation can be considered by taking into account two dimensions: extensional versus intensional, and sequential versus concurrent. Traditionally sequential extensional computation can be captured by the lambda-calculus. However, recent work shows that there are more expressive intensional calculi such as SF-calculus. Traditionally process calculi capture computation by encoding the lambda-calculus, such as in the pi-calculus. Following this increased expressiveness via intensionality, other recent work has shown that concurrent pattern calculus is more expressive than pi-calculus. This paper formalises the relative expressiveness of all four of these calculi by placing them on a square whose edges are irreversible encodings. This square is representative of a more general result: that expressiveness increases with both intensionality and concurrency.
Expressiveness and Completeness in Abstraction
Maciej Gazda,Tim A.C. Willemse
Electronic Proceedings in Theoretical Computer Science , 2012, DOI: 10.4204/eptcs.89.5
Abstract: We study two notions of expressiveness, which have appeared in abstraction theory for model checking, and find them incomparable in general. In particular, we show that according to the most widely used notion, the class of Kripke Modal Transition Systems is strictly less expressive than the class of Generalised Kripke Modal Transition Systems (a generalised variant of Kripke Modal Transition Systems equipped with hypertransitions). Furthermore, we investigate the ability of an abstraction framework to prove a formula with a finite abstract model, a property known as completeness. We address the issue of completeness from a general perspective: the way it depends on certain abstraction parameters, as well as its relationship with expressiveness.
Expressiveness of Communication in Answer Set Programming  [PDF]
Kim Bauters,Jeroen Janssen,Steven Schockaert,Dirk Vermeir,Martine De Cock
Computer Science , 2011,
Abstract: Answer set programming (ASP) is a form of declarative programming that allows to succinctly formulate and efficiently solve complex problems. An intuitive extension of this formalism is communicating ASP, in which multiple ASP programs collaborate to solve the problem at hand. However, the expressiveness of communicating ASP has not been thoroughly studied. In this paper, we present a systematic study of the additional expressiveness offered by allowing ASP programs to communicate. First, we consider a simple form of communication where programs are only allowed to ask questions to each other. For the most part, we deliberately only consider simple programs, i.e. programs for which computing the answer sets is in P. We find that the problem of deciding whether a literal is in some answer set of a communicating ASP program using simple communication is NP-hard. In other words: we move up a step in the polynomial hierarchy due to the ability of these simple ASP programs to communicate and collaborate. Second, we modify the communication mechanism to also allow us to focus on a sequence of communicating programs, where each program in the sequence may successively remove some of the remaining models. This mimics a network of leaders, where the first leader has the first say and may remove models that he or she finds unsatisfactory. Using this particular communication mechanism allows us to capture the entire polynomial hierarchy. This means, in particular, that communicating ASP could be used to solve problems that are above the second level of the polynomial hierarchy, such as some forms of abductive reasoning as well as PSPACE-complete problems such as STRIPS planning.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.