Sciweavers

780 search results - page 115 / 156
» Reasoning about sets using redescription mining
Sort
View
ESOP
2010
Springer
14 years 8 months ago
Parameterized Memory Models and Concurrent Separation Logic
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
Rodrigo Ferreira, Xinyu Feng and Zhong Shao
LICS
2007
IEEE
14 years 5 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
LPNMR
1993
Springer
14 years 3 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
DLOG
2008
14 years 1 months ago
Fuzzy Description Logics for Bilateral Matchmaking in e-Marketplaces
We present a novel Fuzzy Description Logic (DL) based approach to automate matchmaking in e-marketplaces. We model traders' preferences with the aid of Fuzzy DLs and, given a ...
Azzurra Ragone, Umberto Straccia, Fernando Bobillo...
ENTCS
2006
142views more  ENTCS 2006»
13 years 11 months ago
Specialization of Interaction Protocols in a Temporal Action Logic
Temporal logics are well suited for the specification and verification of systems of communicating agents. In this paper we adopt a social approach to agent communication, where c...
Laura Giordano, Alberto Martelli, Camilla Schwind