2911 search results - page 294 / 583 » A Logic of Graph Constraints |
212
click to vote
LANMR
2004
15 years 8 months ago
2004
In previous work we have discussed the importance of identifying the cycles that occur in a logic program under the answer set semantics, and the connections between cycles, that w...
206
click to vote
CAV
2000
Springer
15 years 11 months ago
2000
Springer
Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion . . . . . . . . . . . . . . . . . . . . . . . . . . 1 A. Pnueli Invited Address...
208
click to vote
AAAI
1996
15 years 8 months ago
1996
We introduce a predictive concept recognition methodology for description logics based on a new closed terminology assumption. During knowledge engineering, our system adopts the ...
209
click to vote
ILP
2004
Springer
16 years 1 days ago
2004
Springer
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...
147
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...