2162 search results - page 272 / 433 » Automated Reasoning on Feature Models |
237
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
143
Voted
LICS
2007
IEEE
15 years 11 months ago
2007
IEEE
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
142
click to vote
ECSQARU
2007
Springer
15 years 11 months ago
2007
Springer
This paper presents a new approach to inference in Bayesian networks. The principal idea is to encode the network by logical sentences and to compile the resulting encoding into an...
148
click to vote
ICLP
2007
Springer
15 years 11 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
111
click to vote
TARK
2007
Springer
15 years 11 months ago
2007
Springer
We give derivations of two formal models of Gricean Quantity1 implicature and strong exhaustivity (Van Rooij and Schulz, 2004; Schulz and Van Rooij, 2006), in bidirectional optima...