1278 search results - page 34 / 256 » On the Semantics of Logic Program Composition |
172
Voted
ESOP
1999
Springer
15 years 8 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
165
click to vote
FMCAD
2008
Springer
15 years 5 months ago
2008
Springer
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
139
click to vote
JELIA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The growing size of electronically available text corpora like companies’ intranets or the WWW has made information access a hot topic within computational linguistics....
138
click to vote
JWSR
2007
15 years 4 months ago
2007
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
154
click to vote
IEEESCC
2005
IEEE
15 years 10 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...