Sciweavers

3363 search results - page 592 / 673
» A Framework for Knowledge Reuse
Sort
View
JELIA
2010
Springer
13 years 7 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
JELIA
2010
Springer
13 years 7 months ago
Parametrized Logic Programming
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
Ricardo Gonçalves, José Júlio...
MFCS
2010
Springer
13 years 7 months ago
Asynchronous Omega-Regular Games with Partial Information
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
Bernd Puchala
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 7 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
SIAMSC
2010
132views more  SIAMSC 2010»
13 years 7 months ago
New Algorithms for Optimal Online Checkpointing
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
Philipp Stumm, Andrea Walther