Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
"These notes were prepared for use in the graduate course Computer Science 15–
814: Type Systems for Programming Languages at Carnegie Mellon University.
Their purpose is ...
In this work, we present a computational behavioral model for logic gates called Internode (Internal Node Logic Computational Model) that considers the functionality of the gate a...
Novel, high-throughput technologies are challenging the core of algorithmic methods available in Computer Science. Microarray technologies give Life Sciences researchers the oppor...
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...