Sciweavers

2920 search results - page 12 / 584
» Finite information logic
Sort
View
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 9 months ago
Constraint Functional Logic Programming over Finite Domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
Antonio J. Fernández, Maria Teresa Hortal&a...
LOGCOM
2006
90views more  LOGCOM 2006»
13 years 9 months ago
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
Nick Bezhanishvili, Balder ten Cate
LOGCOM
2006
105views more  LOGCOM 2006»
13 years 9 months ago
A Hybrid Intuitionistic Logic: Semantics and Decidability
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate propertie...
Rohit Chadha, Damiano Macedonio, Vladimiro Sassone
JSYML
2008
84views more  JSYML 2008»
13 years 9 months ago
The modal logic of affine planes is not finitely axiomatisable
We consider a modal language for affine planes, with two sorts of formulas (for points and lines) and three modal boxes. To evaluate formulas, we regard an affine plane as a Kripke...
Ian Hodkinson, Altaf Hussain
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 9 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil