Filters








28,544 Hits in 7.9 sec

An Algebraic Approach to Multi-sorted Constraints [chapter]

Andrei A. Bulatov, Peter Jeavons
2003 Lecture Notes in Computer Science  
We also systematically develop an algebraic structural theory for the general problem, and show that this theory can be used to generalise earlier results about the complexity of certain constraint types  ...  In this paper we describe a new algebraic framework which allows us to deal more precisely with problems where different variables may have different domains.  ...  However, almost all previous work on complexity has focused on the onesorted CSP; the first goal of this paper is to develop an approach which allows us to study the complexity of multi-sorted constraint  ... 
doi:10.1007/978-3-540-45193-8_13 fatcat:xu32bptotjgkhg5jngystqevx4

Complexity of Constraint Languages [chapter]

2013 Qualitative Spatial and Temporal Reasoning  
The natural theory for discussing the properties of constraint types is the mathematical theory of relations and their associated algebras.  ...  In this chapter we will focus on the second approach. That is, we will investigate how the complexity of solving constraint problems varies with the types of constraints which are allowed.  ...  Further developments in the algebraic approach to multi-sorted constraints, and applications to the standard one-sorted CSP where the constraints limit the domain of each variable, are given in [10] .  ... 
doi:10.1002/9781118601457.ch12 fatcat:7j7hws3cuvflnc7kn5svtfpmqe

The Complexity of Constraint Languages [chapter]

David Cohen, Peter Jeavons
2006 Foundations of Artificial Intelligence  
The natural theory for discussing the properties of constraint types is the mathematical theory of relations and their associated algebras.  ...  In this chapter we will focus on the second approach. That is, we will investigate how the complexity of solving constraint problems varies with the types of constraints which are allowed.  ...  Further developments in the algebraic approach to multi-sorted constraints, and applications to the standard one-sorted CSP where the constraints limit the domain of each variable, are given in [10] .  ... 
doi:10.1016/s1574-6526(06)80012-x fatcat:ddy7y6xwknhjvbsnblkonm6iku

On the Multi-Language Construction [chapter]

Samuele Buro, Isabella Mastroeni
2019 Lecture Notes in Computer Science  
In this paper, we broaden the boundary functions-based approachà la Matthews and Findler to propose an algebraic framework that provides a constructive mathematical notion of multi-language able to determine  ...  Whilst this approach enables developers to benefit from the strengths of each single-language, on the other hand it complicates the semantics of such programs.  ...  These specifications are called boundary functions [30] and provide an algebraic meaning to the subsort constraints added by .  ... 
doi:10.1007/978-3-030-17184-1_11 fatcat:palzpdq275eevfdjxycn23mz5y

Sorted Multi-adjoint Logic Programs: Termination Results and Applications [chapter]

C. V. Damásio, J. Medina, M. Ojeda-Aciego
2004 Lecture Notes in Computer Science  
Several extensions of these conditions are presented and related to some well-known formalisms for probabilistic logic programming.  ...  The main contribution is a new sufficient condition which guarantees termination of all queries for the fixpoint semantics for an interesting class of programs.  ...  In this sorted approach each sort identifies an underlying lattice of truth-values (weights) which must satisfy the adjoint conditions.  ... 
doi:10.1007/978-3-540-30227-8_23 fatcat:ogcqfm2o6jgitjbuvmmdkphkhq

Editorial

Hélène Kirchner, Wolfgang Wechler
1992 Theoretical Computer Science  
Lescot show how to extend logic programming to multi-modal logic with dependencies between the different modalities.  ...  These transformation systems are parameterized by an arbitrary algebraic structure to define the primitive predicates.  ... 
doi:10.1016/0304-3975(92)90283-l fatcat:nb6jl2blyrfg3pkdq6yrch5wwi

Semantic Constructions for Hidden Algebra [chapter]

Corina Cirstea
1999 Lecture Notes in Computer Science  
Finally, a layered approach to specifying complex objects in hidden al gebra is presented, with the semantics still involving final/cofree families.  ...  Research supported by an ORS Award and an Oxford Bursary.  ...  Acknowledgement I would like to thank my supervisor, Dr Grant Malcolm, for his continuous advice and encouragement.  ... 
doi:10.1007/3-540-48483-3_5 fatcat:tci3getjvjbxvg2dm4tma3ylza

A Calculator for Pareto Points

Marc Geilen, Twan Basten
2007 2007 Design, Automation & Test in Europe Conference & Exhibition  
Implementations and their complexity of the operations of the algebra are discussed.  ...  This paper presents the Pareto Calculator, a tool for compositional computation of Pareto points, based on the algebra of Pareto points.  ...  Pareto Algebra tries to define an underlying framework to formalise such operations and the tool in this paper supports that approach.  ... 
doi:10.1109/date.2007.364605 dblp:conf/date/GeilenB07 fatcat:4we6vjjlungjzp6blkiyvhuuvu

Semi-automatic design of agent organisations

Anthony Karageorgos, Simon Thompson, Nikolay Mehandjiev
2002 Proceedings of the 2002 ACM symposium on Applied computing - SAC '02  
The role algebra's semantics are formally defined using a two-sorted algebra.  ...  This semi-automatic approach to agent organisation design uses role modelling and a role algebra which captures a number of basic relations among roles.  ...  In the next step, a formal model of role relations, the role algebra, is defined and its semantics are discussed using a two-sorted algebra, The use of the role algebra to design an agent organ[sat[on  ... 
doi:10.1145/508791.508853 dblp:conf/sac/KarageorgosTM02 fatcat:zr27a65g2rdhbgvpuh64mhvc3m

Semi-automatic design of agent organisations

Anthony Karageorgos, Simon Thompson, Nikolay Mehandjiev
2002 Proceedings of the 2002 ACM symposium on Applied computing - SAC '02  
The role algebra's semantics are formally defined using a two-sorted algebra.  ...  This semi-automatic approach to agent organisation design uses role modelling and a role algebra which captures a number of basic relations among roles.  ...  In the next step, a formal model of role relations, the role algebra, is defined and its semantics are discussed using a two-sorted algebra, The use of the role algebra to design an agent organ[sat[on  ... 
doi:10.1145/508848.508853 fatcat:75zgsqlkobhizbde7e6wwdz73m

Termination of logic programs with imperfect information: applications and query procedure

C.V. Damásio, J. Medina, M. Ojeda-Aciego
2007 Journal of Applied Logic  
are presented and related to some well-known probability-based formalisms; in addition, we specify a general non-deterministic tabulation goal-oriented query procedure for sorted multi-adjoint logic programs  ...  The contribution of the paper is two-fold: on the one hand, sufficient conditions guaranteeing termination of all queries for the fix-point semantics for a wide class of sorted multi-adjoint logic programs  ...  Let P be a sorted multi-adjoint logic program with respect to a multi-adjoint Σ -algebra L and a sorted set of propositional symbols Π .  ... 
doi:10.1016/j.jal.2006.03.004 fatcat:7c2v6kd6ijcbtb7ayeuhprz3a4

Extensions of the Minimum Cost Homomorphism Problem [article]

Rustem Takhanov
2012 arXiv   pre-print
An instance of the minimum R-cost homomorphism problem (MinHom_R) is a set of variables V subject to specified constraints together with a positive weight c_vr for each combination of v ∈ V and r ∈ R.  ...  A constraint language is called conservative if every unary relation is a member of it; such constraint languages play an important role in understanding the structure of constraint problems.  ...  An algebra with a finite universe is referred to as a finite algebra. Definition 7.  ... 
arXiv:1210.2260v1 fatcat:pdly27vp5vd63morczpmy3lmum

Extensions of the Minimum Cost Homomorphism Problem [chapter]

Rustem Takhanov
2010 Lecture Notes in Computer Science  
An instance of the minimum R-cost homomorphism problem (M inHomR) is a set of variables V subject to specified constraints together with a positive weight cvr for each combination of v ∈ V and r ∈ R.  ...  A constraint language is called conservative if every unary relation is a member of it; such constraint languages play an important role in understanding the structure of constraint problems.  ...  An algebra with a finite universe is referred to as a finite algebra. Definition 7.  ... 
doi:10.1007/978-3-642-14031-0_36 fatcat:y7lbkfrz4ff67f3xcqjwvezerq

Page 1833 of Mathematical Reviews Vol. , Issue 98C [page]

1998 Mathematical Reviews  
for synchronous concurrent constraint programming (165-178); Davide Ancona and Elena Zucca, An algebraic approach to mixins and modularity (179 193); Heinz FaBbender and Sebastian Maneth, A strict border  ...  for inductive logic programming (227-239); Wai Lam and Snehasis Mukhopadhyay, A two-level approach to learning in nonstationary environments (271-283); Charles X.  ... 

Abstract Constraint Data Types [chapter]

José Luiz Fiadeiro, Fernando Orejas
2015 Lecture Notes in Computer Science  
Following in his footsteps, we provide an extension of the traditional notion of algebraic data type specification to encompass soft-constraints as formalised in [1] .  ...  Martin Wirsing is one of the earliest contributors to the area of Algebraic Specification (e.g., [2] ), which he explored in a variety of domains over many years.  ...  Extending algebraic specifications with constraints We put forward a number of definitions that relate to the so-called c-semiring approach to constraint satisfaction and optimisation proposed in [1]  ... 
doi:10.1007/978-3-319-15545-6_12 fatcat:j6ekd5r3fbbplft3kb3yisonbe
« Previous Showing results 1 — 15 out of 28,544 results