Sciweavers

507 search results - page 63 / 102
» Automating first-order relational logic
Sort
View
CADE
2009
Springer
16 years 1 months ago
Interpolation and Symbol Elimination
Abstract. We prove several results related to local proofs, interpolation and suion calculus and discuss their use in predicate abstraction and invariant generation. Our proofs and...
Andrei Voronkov, Laura Kovács
86
Voted
CADE
2006
Springer
16 years 29 days ago
Using the TPTP Language for Writing Derivations and Finite Interpretations
One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as probl...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Al...
VLDB
2005
ACM
121views Database» more  VLDB 2005»
15 years 6 months ago
Using a Fuzzy Classification Query Language for Customer Relationship Management
A key challenge for companies is to manage customer relationships as an asset. To create an effective toolkit for the analysis of customer relationships, a combination of relation...
Andreas Meier, Nicolas Werro, Martin Albrecht, Mil...
95
Voted
TPHOL
2005
IEEE
15 years 6 months ago
A Design Structure for Higher Order Quotients
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
Peter V. Homeier
99
Voted
KR
2004
Springer
15 years 6 months ago
Expressive Power and Succinctness of Propositional Languages for Preference Representation
Several logical languages have been considered in AI for encoding compactly preference relations over a set of alternatives. In this paper, we analyze both the expressiveness and ...
Sylvie Coste-Marquis, Jérôme Lang, Pa...