725 search results - page 24 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
JAIR
2011
14 years 9 months ago
2011
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...
111
click to vote
AAAI
1998
15 years 3 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
126
click to vote
CORR
2000
Springer
15 years 2 months ago
2000
Springer
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
108
click to vote
AAAI
1990
15 years 3 months ago
1990
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
110
click to vote
LATA
2010
Springer
15 years 12 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...