4401 search results - page 190 / 881 » Computing with Default Logic |
139
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex...
124
click to vote
SIGCSE
2009
ACM
16 years 4 months ago
2009
ACM
ion and Extensibility in Digital Logic Simulation Software Richard M. Salter and John L. Donaldson Computer Science Department Oberlin College Oberlin, OH 44074 rms@cs.oberlin.edu,...
126
click to vote
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
122
click to vote
ERSHOV
2001
Springer
15 years 8 months ago
2001
Springer
A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on r...
110
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
We propose an efficient reconfigurable parallel prefix counting network based on the recently-proposed technique of shift switching with domino logic, where the charge/discharge s...