Sciweavers

1127 search results - page 67 / 226
» Theory Extension in ACL2(r)
Sort
View
CI
2004
119views more  CI 2004»
15 years 19 days ago
Reasoning with Sets of Defaults in Default Logic
We present a general approach for representing and reasoning with sets of defaults in default logic, focussing on reasoning about preferences among sets of defaults. First, we con...
James P. Delgrande, Torsten Schaub
ACSD
2006
IEEE
89views Hardware» more  ACSD 2006»
15 years 4 months ago
On process-algebraic verification of asynchronous circuits
Asynchronous circuits have received much attention recently due to their potential for energy savings. Process algebras have been extensively used in the modelling, analysis and sy...
Xu Wang, Marta Z. Kwiatkowska
STACS
2010
Springer
15 years 7 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
83
Voted
EUSFLAT
2003
131views Fuzzy Logic» more  EUSFLAT 2003»
15 years 2 months ago
From communication networks to fuzzy sets
In 1931 and 1935, Ernst Adolph Guillemin, professor of electrical engineering at Masachusetts Institute of Technology (MIT), published the two volumes of his book “Communication...
Rudolf Seising
132
Voted
CALCO
2009
Springer
138views Mathematics» more  CALCO 2009»
15 years 7 months ago
Kleene Monads: Handling Iteration in a Framework of Generic Effects
Abstract. Monads are a well-established tool for modelling various computational effects. They form the semantic basis of Moggi’s computational metalanguage, the metalanguage of ...
Sergey Goncharov, Lutz Schröder, Till Mossako...