3624 search results - page 74 / 725 » Abstract Algebraic Logic |
126
click to vote
IJAC
2002
15 years 4 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
140
click to vote
TARK
2005
Springer
15 years 10 months ago
2005
Springer
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...
130
click to vote
SIGSOFT
2005
ACM
16 years 5 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
129
click to vote
IFIP
2009
Springer
15 years 9 months ago
2009
Springer
Trust dilution and trust fusion are two operators that are used to calculate transitive trust in a trust network. Various implementations of these operators already exist but are n...
128
click to vote
UAI
1989
15 years 5 months ago
1989
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...