4401 search results - page 124 / 881 » Computing with Default Logic |
CIE
2007
Springer
14 years 3 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
EUSFLAT
2009
13 years 6 months ago
2009
-- An approach to estimate the number of rules by spectral analysis of the training dataset has been recently proposed [1]. This work presents an analysis of such a method in high ...
IJCAI
2001
13 years 10 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
CORR
1998
Springer
13 years 8 months ago
1998
Springer
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
ICCAD
2000
IEEE
14 years 1 months ago
2000
IEEE
We address optimizing multi-valued (MV) logic functions in a multi-level combinational logic network. Each node in the network, called an MV-node, has multi-valued inputs and sing...