393 search results - page 16 / 79 » Abstract Interpretation of Probabilistic Semantics |
TBILLC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce an inquisitive semantics for a language of propositional logic, where the interpretation of disjunction is the source of inquisitiveness. Indicative conditio...
TPHOL
1999
IEEE
14 years 22 hour ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
SAS
1999
Springer
14 years 6 hour ago
1999
Springer
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
We introduce the posterior probabilistic clustering (PPC), which provides a rigorous posterior probability interpretation for Nonnegative Matrix Factorization (NMF) and removes th...
AAAI
2004
13 years 9 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...