Sciweavers

2609 search results - page 17 / 522
» Models for Global Constraint Applications
Sort
View
ACL
2010
14 years 7 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
ANSOFT
2002
171views more  ANSOFT 2002»
14 years 9 months ago
OPM/Web - Object-Process Methodology for Developing Web Applications
Web applications can be classified as hybrids between hypermedia and information systems. They have a relatively simple distributed architecture from the user viewpoint, but a comp...
Iris Reinhartz-Berger, Dov Dori, Shmuel Katz
WAIM
2005
Springer
15 years 2 months ago
Integrity Theory for Resource Space Model and Its Application
The Resource Space Model (RSM) is a semantic data model based on orthogonal classification semantics for effectively managing various resources in interconnection environment. In p...
Hai Zhuge, Yunpeng Xing
AICOM
2004
92views more  AICOM 2004»
14 years 9 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu
CP
2007
Springer
15 years 3 months ago
Advisors for Incremental Propagation
Abstract. While incremental propagation for global constraints is recognized to be important, little research has been devoted to how propagator-centered constraint programming sys...
Mikael Z. Lagerkvist, Christian Schulte