4401 search results - page 295 / 881 » Computing with Default Logic |
168
click to vote
DATE
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper presents a method for redundancy identification (RID) using multi-node logic implications. The algorithm discovers a large number of direct and indirect implications b...
157
click to vote
TABLEAUX
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...
192
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
132
click to vote
LILOG
1989
15 years 10 months ago
1989
We propose a theory for reasoning about actions based on order-sorted predicate logic where one can consider an elaborate taxonomy of objects. We are interested in the projection ...
157
click to vote
FPL
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. In this paper we outline a procedure to determine appropriate partitioning of programmable logic and interconnect area to minimize overall device area across a broad rang...