Sciweavers

6167 search results - page 1002 / 1234
» Can Refinement be Automated
Sort
View
NMR
2004
Springer
14 years 4 months ago
On acyclic and head-cycle free nested logic programs
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
Thomas Linke, Hans Tompits, Stefan Woltran
PATAT
2004
Springer
138views Education» more  PATAT 2004»
14 years 4 months ago
Semantic Components for Timetabling
Abstract. Automated timetabling is a research domain that has occupied many researchers over the last 50 years. Several algorithms have proven to be applicable to timetabling but t...
Nele Custers, Patrick De Causmaecker, Peter Demees...
POLICY
2004
Springer
14 years 4 months ago
Responding to Policies at Runtime in TrustBuilder
Automated trust negotiation is the process of establishing trust between entities with no prior relationship through the iterative disclosure of digital credentials. One approach ...
Bryan Smith, Kent E. Seamons, Michael D. Jones
PPSWR
2004
Springer
14 years 4 months ago
Calendrical Calculations with Time Partitionings and Fuzzy Time Intervals
This paper presents a piece in a big mosaic which consists of formalisms and software packages for representing and reasoning with everyday temporal notions. The kernel of the mosa...
Hans Jürgen Ohlbach
AGP
2003
IEEE
14 years 4 months ago
Local Closed-World Assumptions for reasoning about Semantic Web data
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...
Elisa Bertino, Alessandro Provetti, Franco Salvett...
« Prev « First page 1002 / 1234 Last » Next »