8094 search results - page 15 / 1619 » Improvements in Formula Generalization |
96
Voted
STOC
1987
ACM
15 years 7 months ago
1987
ACM
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
124
Voted
CORR
1998
Springer
15 years 3 months ago
1998
Springer
An important characteristic of many logics for Arti cial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequ...
114
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2log1−ǫ (n) -inapproximability re...
130
Voted
ICLP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
94
Voted
IGPL
1998
15 years 3 months ago
1998
A formula A is said to have the contractionproperty in a logic L i whenever A;A;? `L B (when ? is a multiset) also A;? `L B. In MLL and in MALL without the additive constants a fo...