Approximating propositional knowledge with affine formulas
... Not many classes of formulas satisfy these requirements. Horn formulas are often considered for approximating knowledge (see for instance [10]), but they have some limits : e.g., the shortest Horn approximation of a knowledge base may be exponentially larger than its set of models, and some problems ...
... Not many classes of formulas satisfy these requirements. Horn formulas are often considered for approximating knowledge (see for instance [10]), but they have some limits : e.g., the shortest Horn approximation of a knowledge base may be exponentially larger than its set of models, and some problems ...
full paper - Frontiers in Artificial Intelligence and Applications (FAIA)
... KBs can be represented exactly by a formula with good properties ; in this case, the formula can give the answer to any query. To summarize, approximations can help saving a lot of time when answering queries (for instance in an on-line framework), especially if they can be reasoned with efficiently ...
... KBs can be represented exactly by a formula with good properties ; in this case, the formula can give the answer to any query. To summarize, approximations can help saving a lot of time when answering queries (for instance in an on-line framework), especially if they can be reasoned with efficiently ...
Resolve and Expand
... Expansion often needs to copy almost all clauses of the CNF. Moreover, the elimination procedures of Sec. 3 produce a lot of redundant subsumed clauses. Therefore, subsumed clauses should be removed. If a new clause is added, all old clauses are checked for being subsumed by this new clause. This ch ...
... Expansion often needs to copy almost all clauses of the CNF. Moreover, the elimination procedures of Sec. 3 produce a lot of redundant subsumed clauses. Therefore, subsumed clauses should be removed. If a new clause is added, all old clauses are checked for being subsumed by this new clause. This ch ...
Quantitatively Evaluating Formula-Variable Relevance by
... Lang and Marquis [3,4] presented a method to resolve inconsistencies of a given knowledge base via variable forgetting. As we know, it is a common thing that inconsistencies may occur in a knowledge base due to different sources of knowledge or different views of the world for each person. In classi ...
... Lang and Marquis [3,4] presented a method to resolve inconsistencies of a given knowledge base via variable forgetting. As we know, it is a common thing that inconsistencies may occur in a knowledge base due to different sources of knowledge or different views of the world for each person. In classi ...
Non-CNF QBF Solving with QCIR - Institute for Formal Models and
... and Tacchella 2006)) and is still the input format of the main tracks of the recent competitions. It is supported by most state-of-the-art QBF solvers and therefore most applications which aim at using a QBF solver generate formulas in QDIMACS format. In order to establish non-CNF formats, several e ...
... and Tacchella 2006)) and is still the input format of the main tracks of the recent competitions. It is supported by most state-of-the-art QBF solvers and therefore most applications which aim at using a QBF solver generate formulas in QDIMACS format. In order to establish non-CNF formats, several e ...
Propositional Fragments for Knowledge
... QBF is investigated. A propositional fragment is said to be tractable for QBF if and only if the membership to the fragment can be decided in polynomial time, and there also exists a polytime decision algorithm for the validity problem of (closed, polite, prenex) quantified boolean formulae whose ma ...
... QBF is investigated. A propositional fragment is said to be tractable for QBF if and only if the membership to the fragment can be decided in polynomial time, and there also exists a polytime decision algorithm for the validity problem of (closed, polite, prenex) quantified boolean formulae whose ma ...
from Converse PDL - School of Computer Science
... without compromising the soundness and completeness of inference for it. Specifically we present an intuitive encoding of CPDL formulae into PDL that eliminates the converse programs from a CPDL formula, but adds enough information so as not to destroy its original meaning with respect to satisfiabi ...
... without compromising the soundness and completeness of inference for it. Specifically we present an intuitive encoding of CPDL formulae into PDL that eliminates the converse programs from a CPDL formula, but adds enough information so as not to destroy its original meaning with respect to satisfiabi ...
A Decision Procedure for a Fragment of Linear Time Mu
... 0 , e0 , 1 , e1 , . . . in a GPG, we can obtain its corresponding linear time structure Atom( e0 ), Atom( e1 ), . . .. For example, in Figure 1, the path n0 , true, n2 , p, (n1 , true)! corresponds to the linear time structure {true}{p}{true}! . From Figure 1 we can see that there may exist a path i ...
... 0 , e0 , 1 , e1 , . . . in a GPG, we can obtain its corresponding linear time structure Atom( e0 ), Atom( e1 ), . . .. For example, in Figure 1, the path n0 , true, n2 , p, (n1 , true)! corresponds to the linear time structure {true}{p}{true}! . From Figure 1 we can see that there may exist a path i ...
Reformulation based MaxSAT robustness (Extended abstract)
... We now show how we can reformulate an initial formula F to an extended formula FSM , whose solution is a robust solution to F . We achieve this by means of Boolean cardinality constraints, which allow us to state, for a given set of Boolean variables E and a given number p, that at most p variables ...
... We now show how we can reformulate an initial formula F to an extended formula FSM , whose solution is a robust solution to F . We achieve this by means of Boolean cardinality constraints, which allow us to state, for a given set of Boolean variables E and a given number p, that at most p variables ...