3119 search results - page 312 / 624 » General Default Logic |
193
click to vote
AAAI
1998
15 years 8 months ago
1998
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
221
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
152
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
165
click to vote
JIIS
2008
15 years 6 months ago
2008
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
188
click to vote
TCAD
2002
15 years 6 months ago
2002
With the advent of system-on-a-chip design, many application specific integrated circuits (ASICs) now require multiple design clocks that operate asynchronously to each other. This...