Sciweavers

507 search results - page 61 / 102
» Automating first-order relational logic
Sort
View
200
Voted
ICLP
2009
Springer
16 years 1 months ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
CADE
2003
Springer
16 years 29 days ago
Proof Search and Proof Check for Equational and Inductive Theorems
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
Eric Deplagne, Claude Kirchner, Hélè...
112
Voted
LICS
1999
IEEE
15 years 5 months ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
DLOG
2010
14 years 10 months ago
Towards Formal Comparison of Ontology Linking, Mapping and Importing
Multiple distributed and modular ontology representation frameworks have recently appeared. They typically extend Description Logics (DL), with new constructs to represent relation...
Martin Homola, Luciano Serafini
98
Voted
RSCTC
2004
Springer
121views Fuzzy Logic» more  RSCTC 2004»
15 years 6 months ago
On the Correspondence between Approximations and Similarity
Abstract. This paper focuses on the use and interpretation of approximate databases where both rough sets and indiscernibility partitions are generalized and replaced by approximat...
Patrick Doherty, Andrzej Szalas