Sciweavers

2962 search results - page 314 / 593
» Reasoning on Association Rules
Sort
View
CSL
2007
Springer
16 years 27 days ago
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
WOWMOM
2005
ACM
106views Multimedia» more  WOWMOM 2005»
16 years 8 days ago
A Framework for Dynamic Service Composition
To be able to utilize the generative potential of future networks for service composition, the attributes of services and networks must be appropriately formalized, stored and mad...
Paramai Supadulchai, Finn Arve Aagesen
ECSQARU
2005
Springer
16 years 7 days ago
Conditional Deduction Under Uncertainty
Conditional deduction in binary logic basically consists of deriving new statements from an existing set of statements and conditional rules. Modus Ponens, which is the classical e...
Audun Jøsang, Simon Pope, Milan Daniel
LPNMR
2005
Springer
16 years 6 days ago
Answer Sets for Propositional Theories
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...
Paolo Ferraris
189
Voted
OTM
2005
Springer
16 years 6 days ago
OWL-Based User Preference and Behavior Routine Ontology for Ubiquitous System
In ubiquitous computing, behavior routine learning is the process of mining the context-aware data to find interesting rules on the user’s behavior, while preference learning tri...
Kim Anh Pham Ngoc, Young-Koo Lee, Sungyoung Lee