Sciweavers

2911 search results - page 320 / 583
» A Logic of Graph Constraints
Sort
View
CADE
2004
Springer
16 years 7 months ago
A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
Yevgeny Kazakov, Hans de Nivelle
VTS
2006
IEEE
101views Hardware» more  VTS 2006»
16 years 19 days ago
Design Optimization for Robustness to Single Event Upsets
Abstract: An optimization algorithm for the design of combinational circuits that are robust to single-event upsets (SEUs) is described. A simple, highly accurate model for the SEU...
Quming Zhou, Mihir R. Choudhury, Kartik Mohanram
LPNMR
2005
Springer
16 years 3 days ago
On Modular Translations and Strong Equivalence
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
Paolo Ferraris
RSCTC
2004
Springer
116views Fuzzy Logic» more  RSCTC 2004»
15 years 12 months ago
Constrained Sums of Information Systems
We study properties of infomorphisms between information systems. In particular, we interpret infomorphisms between information systems in terms of sums with constraints (constrain...
Andrzej Skowron, Jaroslaw Stepaniuk
JUCS
2007
102views more  JUCS 2007»
15 years 6 months ago
Pedagogical Natural Deduction Systems: the Propositional Case
: This paper introduces the notion of pedagogical natural deduction systems, which are natural deduction systems with the following additional constraint: all hypotheses made in a ...
Loïc Colson, David Michel