507 search results - page 70 / 102 » Automating first-order relational logic |
ECSQARU
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
111
Voted
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...
EDBT
2002
ACM
16 years 22 days ago
2002
ACM
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for information filtering and ex...
115
Voted
CSL
2010
Springer
15 years 1 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
115
click to vote
KR
2000
Springer
15 years 4 months ago
2000
Springer
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...