scholarly journals A Uniform Treatment of Aggregates and Constraints in Hybrid ASP

Author(s):  
Pedro Cabalar ◽  
Jorge Fandinno ◽  
Torsten Schaub ◽  
Philipp Wanko

Characterizing hybrid ASP solving in a generic way is difficult since one needs to abstract from specific theories. Inspired by lazy SMT solving, this is usually addressed by treating theory atoms as opaque. Unlike this, we propose a slightly more transparent approach that includes an abstract notion of a term. Rather than imposing a syntax on terms, we keep them abstract by stipulating only some basic properties. With this, we further develop a semantic framework for hybrid ASP solving and provide aggregate functions for theory variables that adhere to different semantic principles, show that they generalize existing aggregate semantics in ASP and how we can rely on off-the-shelf hybrid solvers for implementation.

1995 ◽  
Vol 5 (2) ◽  
pp. 257-282 ◽  
Author(s):  
Egidio Astesiano ◽  
Elena Zucca

We propose a semantic framework for dynamic systems, which, in a sense, extends the well-known algebraic approach for modelling static data structures to the dynamic case. The framework is based on a new mathematical structure, called a d-oid, consisting of a set of instant structures and a set of dynamic operations. An instant structure is a static structure, e.g. an algebra; a dynamic operation is a transformation of instant structures with an associated point to point map, which allows us to keep track of the transformations of single objects and thus is called a tracking map. By an appropriate notion of morphism, the d-oids over a dynamic signature constitute a category.It is shown that d-oids can model object systems and support an abstract notion of possibly unique object identity; moreover, for a d-oid satisfying an identity preserving condition, there exists an essentially equivalent d-oid where the elements of instant structures are just names.


2001 ◽  
Vol 1 (6) ◽  
pp. 647-690 ◽  
Author(s):  
Roberto Bruni ◽  
Ugo Montanari ◽  
Francesca Rossi

We apply to logic programming some recently emerging ideas from the field of reductionbased communicating systems, with the aim of giving evidence of the hidden interactions and the coordination mechanisms that rule the operational machinery of such a programming paradigm. The semantic framework we have chosen for presenting our results is tile logic, which has the advantage of allowing a uniform treatment of goals and observations and of applying abstract categorical tools for proving the results. As main contributions, we mention the finitary presentation of abstract unification, and a concurrent and coordinated abstract semantics consistent with the most common semantics of logic programming. Moreover, the compositionality of the tile semantics is guaranteed by standard results, as it reduces to check that the tile systems associated to logic programs enjoy the tile decomposition property. An extension of the approach for handling constraint systems is also discussed.


2012 ◽  
Author(s):  
Hal Warren ◽  
Jon Corson-Rikert ◽  
Gary Vandenbos ◽  
Kristi Holmes ◽  
Eva Winer

2005 ◽  
pp. 131-141
Author(s):  
V. Mortikov

The basic properties of international public goods are analyzed in the paper. Special attention is paid to the typology of international public goods: pure and impure, excludable and nonexcludable, club goods, regional public goods, joint products. The author argues that social construction of international public good depends on many factors, for example, government economic policy. Aggregation technologies in the supply of global public goods are examined.


2020 ◽  
Vol 23 (3) ◽  
pp. 227-252
Author(s):  
T.E. Rudenko ◽  
◽  
A.N. Nazarov ◽  
V.S. Lysenko ◽  
◽  
...  

2012 ◽  
Vol 132 (11) ◽  
pp. 420-424 ◽  
Author(s):  
Yuusuke Tanaka ◽  
Katsuhiko Tanaka ◽  
Susumu Sugiyama ◽  
Hisanori Shiomi ◽  
Yoshimasa Kurumi ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document