Sciweavers

694 search results - page 52 / 139
» Open Graphs and Computational Reasoning
Sort
View
MFCS
2005
Springer
14 years 3 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
KR
1992
Springer
14 years 2 months ago
Embedding Defaults into Terminological Knowledge Representation Formalisms
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
Franz Baader, Bernhard Hollunder
AOSD
2010
ACM
14 years 5 months ago
Tracking code patterns over multiple software versions with Herodotos
An important element of understanding a software code base is to identify the repetitive patterns of code it contains and how these evolve over time. Some patterns are useful to t...
Nicolas Palix, Julia L. Lawall, Gilles Muller
ICLP
2005
Springer
14 years 3 months ago
A Generic Framework for the Analysis and Specialization of Logic Programs
The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the part...
Germán Puebla, Elvira Albert, Manuel V. Her...
LICS
2006
IEEE
14 years 4 months ago
A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics
d Abstract) Marcelo Fiore∗ and Sam Staton† Computer Laboratory, University of Cambridge We introduce a mathematical structural operational semantics that yields a congruence r...
Marcelo P. Fiore, Sam Staton