2308 search results - page 265 / 462 » Representing Symbolic Reasoning |
179
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
202
click to vote
TPHOL
2009
IEEE
16 years 1 months ago
2009
IEEE
Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, givi...
187
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Being able to extend an OWL ontology with some form of rules is a feature that many ontology developers consider as very important. Nevertheless, working with rules in practice can...
214
click to vote
TIME
2008
IEEE
16 years 1 months ago
2008
IEEE
Frequent behavioural pattern mining is a very important topic of knowledge discovery, intended to extract correlations between items recorded in large databases or Web acces logs....
211
click to vote
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...