Sciweavers

736 search results - page 7 / 148
» A Science of Reasoning (Extended Abstract)
Sort
View
FOCS
1995
IEEE
13 years 11 months ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
Noga Alon, Jeff Edmonds, Michael Luby
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
13 years 2 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
LATIN
2000
Springer
13 years 11 months ago
Equivalent Conditions for Regularity (Extended Abstract)
d abstract) Book section (Refereed) Original citation: Originally published in Gonnet, G; Panario D; Viola, A, LATIN 2000: theoretical informatics. Lecture notes in computer scienc...
Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Sko...
COMMA
2010
13 years 2 months ago
Reasoning about Preferences in Structured Extended Argumentation Frameworks
Abstract. This paper combines two recent extensions of Dung's abstract argumenrameworks in order to define an abstract formalism for reasoning about preferences in structured ...
Sanjay Modgil, Henry Prakken
CADE
2006
Springer
14 years 7 months ago
CEL - A Polynomial-Time Reasoner for Life Science Ontologies
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
Franz Baader, Carsten Lutz, Boontawee Suntisrivara...