1737 search results - page 140 / 348 » On Interpolation in Existence Logics |
198
click to vote
JELIA
2004
Springer
15 years 11 months ago
2004
Springer
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very e...
173
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
Structural logical formulas sometimes yield a substantial fraction of so called equivalence clauses after translating to CNF. The best known example of this feature is probably pro...
140
click to vote
DATE
1998
IEEE
15 years 10 months ago
1998
IEEE
1 Redundancy removal is an important step in combinational logic optimization. After a redundant wire is removed, other originally redundant wires may become irredundant, and some ...
164
click to vote
IJCAI
2007
15 years 7 months ago
2007
Few existing argumentation frameworks are designed to deal with probabilistic knowledge, and none are designed to represent possibilistic knowledge, making them unsuitable for man...
192
click to vote
BIRTHDAY
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...