Sciweavers

531 search results - page 33 / 107
» An Argumentation-Based Approach for Practical Reasoning
Sort
View
LPAR
2010
Springer
15 years 1 months ago
Counting and Enumeration Problems with Bounded Treewidth
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
DLOG
2009
15 years 1 months ago
What Happened to Bob? Semantic Data Mining of Context Histories
We report on event recognition within the life logging application IYOUIT for the automatic creation of static diary-like Blogs. Based on the qualitative context histories produced...
Michael Wessel, Marko Luther, Ralf Möller
ODR
2008
15 years 5 months ago
Re-Consider: The Integration of Online Dispute Resolution and Decision Support Systems
Current approaches for the design of Online Dispute Resolution (ODR) systems involve the replication of Alternative Dispute Resolution practices such as mediation and negotiation. ...
Nial Muecke, Andrew Stranieri, Charlynn Miller
ENTCS
2007
101views more  ENTCS 2007»
15 years 3 months ago
Semantic Determinism and Functional Logic Program Properties
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
José Miguel Cleva, Francisco Javier L&oacut...
132
Voted
DAC
2005
ACM
16 years 4 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu