Sciweavers

1916 search results - page 115 / 384
» Reasoning with class algebra
Sort
View
105
Voted
PPDP
2009
Springer
15 years 7 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano
151
Voted
LPAR
1999
Springer
15 years 5 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
AAMAS
2008
Springer
15 years 27 days ago
DARE: a system for distributed abductive reasoning
Abductive reasoning is a well established field of Artificial Intelligence widely applied to different problem domains not least cognitive robotics and planning. It has been used ...
Jiefei Ma, Alessandra Russo, Krysia Broda, Keith C...
84
Voted
COCO
1989
Springer
110views Algorithms» more  COCO 1989»
15 years 4 months ago
The Complexity of Iterated Multiplication
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
Neil Immerman, Susan Landau
84
Voted
AAECC
2006
Springer
100views Algorithms» more  AAECC 2006»
15 years 25 days ago
On Doubly-Cyclic Convolutional Codes
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(xn - 1), where F is a finite field. A particular choice of the data leads to th...
Heide Gluesing-Luerssen, Wiland Schmale