3119 search results - page 133 / 624 » General Default Logic |
162
Voted
NMR
2004
Springer
15 years 10 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
173
click to vote
AGP
2003
IEEE
15 years 10 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
136
Voted
GLVLSI
2003
IEEE
15 years 10 months ago
2003
IEEE
We introduce a simple hierarchical design technique for using dynamic domino circuits to build high-performance self-timed data path circuits. We wrap the dynamic domino circuit i...
139
Voted
ML
2006
ACM
15 years 5 months ago
2006
ACM
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 ...
138
click to vote
IGPL
1998
15 years 4 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...