Sciweavers

2084 search results - page 139 / 417
» Set Constraints in Logic Programming
Sort
View
TASE
2008
IEEE
16 years 25 days ago
Verifying BPEL-Like Programs with Hoare Logic
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechan...
Chenguang Luo, Shengchao Qin, Zongyan Qiu
COSIT
2011
Springer
322views GIS» more  COSIT 2011»
14 years 6 months ago
CLP(QS): A Declarative Spatial Reasoning Framework
Abstract. We propose CLP(QS), a declarative spatial reasoning framework capable of representing and reasoning about high-level, qualitative spatial knowledge about the world. We sy...
Mehul Bhatt, Jae Hee Lee, Carl Schultz
INFORMS
2010
100views more  INFORMS 2010»
15 years 3 months ago
Two-Step MIR Inequalities for Mixed Integer Programs
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
Sanjeeb Dash, Marcos Goycoolea, Oktay Günl&uu...
PPDP
1999
Springer
15 years 10 months ago
Distributed Programming in a Multi-Paradigm Declarative Language
Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programming paradigms. Curry’s operational semantics is based on lazy reduction of expre...
Michael Hanus
CP
2005
Springer
15 years 12 months ago
Specialised Constraints for Stable Matching Problems
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
Chris Unsworth, Patrick Prosser