135 search results - page 22 / 27 » Constructive Logic with Strong Negation as a Substructural L... |
IANDC
2006
13 years 6 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
ICLP
2009
Springer
14 years 7 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
CIE
2007
Springer
14 years 26 days ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
BIRTHDAY
2009
Springer
14 years 1 months ago
2009
Springer
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...