Sciweavers

1364 search results - page 12 / 273
» Comparative Branching-Time Semantics
Sort
View
IJCAI
2001
13 years 8 months ago
A Comparative Study of Logic Programs with Preference
We are interested in semantical underpinnings for existing approaches to preference handling in extended logic programming (within the framework of answer set programming). As a s...
Torsten Schaub, Kewen Wang
ENTCS
2002
111views more  ENTCS 2002»
13 years 7 months ago
Comparing Meseguer's Rewriting Logic with the Logic CRWL
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
Miguel Palomino Tarjuelo
CSFW
1996
IEEE
13 years 11 months ago
Comparing Two Information Flow Security Properties
In this paper we compare two information flow security properties: the lazy security (L-Sec) [11] and the Bisimulation Non-deducibility on Compositions (BNDC) [4]. To make this we...
Riccardo Focardi
DAGM
2008
Springer
13 years 9 months ago
Comparing Local Feature Descriptors in pLSA-Based Image Models
Abstract. Probabilistic models with hidden variables such as probabilistic Latent Semantic Analysis (pLSA) and Latent Dirichlet Allocation (LDA) have recently become popular for so...
Eva Hörster, Thomas Greif, Rainer Lienhart, M...
ECAI
2004
Springer
13 years 11 months ago
Goal Specification in Presence of Non-Deterministic Actions
One important aspect in directing cognitive robots or agents is to formally specify what is expected of them. This is often referred to as goal specification. For agents whose act...
Chitta Baral, Jicheng Zhao