Sciweavers

3047 search results - page 159 / 610
» On the Meaning of Logical Completeness
Sort
View
CSL
2008
Springer
15 years 2 months ago
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
Ian Hodkinson, Angelo Montanari, Guido Sciavicco
121
Voted
DLOG
2003
15 years 2 months ago
Applying Description Logic to Product Behavioral Design within Advanced CAD Systems
In this paper, we investigate the use of Description Logic (DL) for representing Product Behavioral constraints in Computer Aided Design (CAD) Systems. In an integrated design app...
François de Bertrand de Beuvron, Amadou Cou...
MLQ
2008
63views more  MLQ 2008»
15 years 23 days ago
On triangular norm based axiomatic extensions of the weak nilpotent minimum logic
In this paper we carry out an algebraic investigation of the Weak Nilpotent Minimum logic (WNM) and its t-norm based axiomatic extensions. We consider the algebraic counterpart of...
Carles Noguera, Francesc Esteva, Joan Gispert
106
Voted
MSCS
2008
97views more  MSCS 2008»
15 years 23 days ago
Logical relations for monadic types
Abstract. Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs c...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...
CORR
2012
Springer
188views Education» more  CORR 2012»
13 years 8 months ago
A Logical Characterization of Constraint-Based Causal Discovery
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...
Tom Claassen, Tom Heskes