Sciweavers

1391 search results - page 70 / 279
» Completeness of Neighbourhood Logic
Sort
View
CADE
2001
Springer
14 years 9 months ago
Termination and Reduction Checking for Higher-Order Logic Programs
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Brigitte Pientka
DALT
2003
Springer
14 years 2 months ago
A logic for ignorance
We introduce and motivate a non-standard multi-modal logic to represent and reason about ignorance in Multi-Agent Systems. We argue that in Multi-agent systems being able to reaso...
Wiebe van der Hoek, Alessio Lomuscio
CLIMA
2007
13 years 10 months ago
Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
We present a sound and complete tableau calculus for a class BReg of extended regular modal logics which contains useful epistemic logics for reasoning about agent beliefs. Our cal...
Rajeev Goré, Linh Anh Nguyen
MLQ
2007
111views more  MLQ 2007»
13 years 8 months ago
On n-contractive fuzzy logics
It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w.r.t. the class of all finite MTL-chains. In order to reach a deeper understanding ...
Rostislav Horcík, Carles Noguera, Milan Pet...
JSAI
2007
Springer
14 years 3 months ago
Towards a Logical Reconstruction of CF-Induction
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
Yoshitaka Yamamoto, Oliver Ray, Katsumi Inoue