725 search results - page 39 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
LPNMR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
137
click to vote
ICS
2001
Tsinghua U.
15 years 7 months ago
2001
Tsinghua U.
The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs th...
135
click to vote
JAIR
2007
15 years 2 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
118
Voted
ICCD
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we make two major contributions: First, to enhance Boolean learning, we propose a new class of logic implications called extended forward implications. Using a nove...
139
click to vote
TLCA
2007
Springer
15 years 8 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...