Sciweavers

2962 search results - page 392 / 593
» Reasoning on Association Rules
Sort
View
CORR
2008
Springer
148views Education» more  CORR 2008»
15 years 5 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
SEMWEB
2010
Springer
15 years 4 months ago
Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach
RDF(S) and OWL 2 currently support only static ontologies. In practice, however, the truth of statements often changes with time, and Semantic Web applications often need to repres...
Boris Motik
JAIR
2011
72views more  JAIR 2011»
15 years 1 months ago
A Logical Study of Partial Entailment
We introduce a novel logical notion–partial entailment–to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with...
Y. Zhou, Y. Zhang
JLP
2010
142views more  JLP 2010»
15 years 1 months ago
Relational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
Lennart Beringer
AAAI
2012
13 years 9 months ago
HyperPlay: A Solution to General Game Playing with Imperfect Information
General Game Playing is the design of AI systems able to understand the rules of new games and to use such descriptions to play those games effectively. Games with imperfect infor...
Michael John Schofield, Timothy Joseph Cerexhe, Mi...