Sciweavers

4370 search results - page 481 / 874
» Algebra of Logic Programming
Sort
View
153
Voted
NGITS
1999
Springer
15 years 8 months ago
From Object-Process Diagrams to a Natural Object-Process Language
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
Mor Peleg, Dov Dori
NDJFL
1998
105views more  NDJFL 1998»
15 years 3 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
160
Voted
CORR
2011
Springer
185views Education» more  CORR 2011»
14 years 10 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
CALCO
2009
Springer
172views Mathematics» more  CALCO 2009»
15 years 10 months ago
Coalgebraic Components in a Many-Sorted Microcosm
The microcosm principle, advocated by Baez and Dolan and formalized for Lawvere theories lately by three of the authors, has been applied to coalgebras in order to describe composi...
Ichiro Hasuo, Chris Heunen, Bart Jacobs, Ana Sokol...
IFIP
2009
Springer
15 years 10 months ago
Analysing the Information Flow Properties of Object-Capability Patterns
We consider the problem of detecting covert channels within security-enforcing object-capability patterns. Traditional formalisms for reasoning about the security properties of obj...
Toby C. Murray, Gavin Lowe