96 search results - page 11 / 20 » Conditional Term Rewriting as a Deductive Database Language |
GISCIENCE
2008
Springer
13 years 12 months ago
2008
Springer
Road networks, roads, and junctions are examples of natural language terms whose semantics can be described by affordances of their physical referents. In order to define affordanc...
SAC
2008
ACM
13 years 10 months ago
2008
ACM
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...
IDEAS
2002
IEEE
14 years 3 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
RML
2002
13 years 10 months ago
2002
In E-commerce processes, various rules and constraints regarding product specifications, pricing, terms and conditions are exchanged between vendors and buyers. Developing a forma...
CADE
2008
Springer
14 years 11 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...