Sciweavers

4370 search results - page 325 / 874
» Algebra of Logic Programming
Sort
View
91
Voted
DAC
2003
ACM
16 years 1 months ago
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Br...
TPHOL
2007
IEEE
15 years 7 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker
DLOG
2003
15 years 2 months ago
Description Logic Systems
The Semantic Web initiative defines important challenges for knowledge representation and database systems. Recently, several standards for representation languages have been pro...
Ralf Möller, Volker Haarslev
84
Voted
EACL
1989
ACL Anthology
15 years 2 months ago
A logical treatment of semi-free word order and bounded discontinuous constituency
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
Mike Reape
CORR
2006
Springer
144views Education» more  CORR 2006»
15 years 26 days 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