464 search results - page 10 / 93 » Modeling Semantic Constraints with Logic in the EARL Data Mo... |
AAAI
2000
13 years 8 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
ICLP
2010
Springer
13 years 10 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
LPNMR
2004
Springer
14 years 2 days ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
ICWS
2008
IEEE
13 years 8 months ago
2008
IEEE
In this work, we present a framework for the semantic composition of web services based on Statecharts and uniform community service descriptions. Our model is a two step process....
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Time is one of the most difficult aspects to handle in real world applications such as database systems. Relational database management systems proposed by Codd offer very little ...