Sciweavers

1549 search results - page 68 / 310
» On the rules of intermediate logics
Sort
View
SAT
2009
Springer
121views Hardware» more  SAT 2009»
14 years 3 months ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
PEPM
2007
ACM
14 years 3 months ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal
LATIN
2004
Springer
14 years 2 months ago
A Proof System and a Decision Procedure for Equality Logic
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
Olga Tveretina, Hans Zantema
JAPLL
2006
112views more  JAPLL 2006»
13 years 9 months ago
Intuitionistic hybrid logic
Hybrid logics are a principled generalization of both modal logics and description logics, a standard formalism for knowledge representation. In this paper we give the first const...
Torben Braüner, Valeria de Paiva
GCC
2003
Springer
14 years 2 months ago
Toward the Composition of Semantic Web Services
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
Jinghai Rao, Xiaomeng Su