764 search results - page 116 / 153 » On the Expressibility of Stable Logic Programming |
104
click to vote
PODS
2007
ACM
15 years 12 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
FCT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
106
click to vote
ISMVL
2000
IEEE
15 years 4 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
APWEB
2006
Springer
15 years 3 months ago
2006
Springer
In the semantic web context,the formal representation of knowledge is not resourceful while the informal one with uncertainty prevails. In order to provide an uncertainty reasoning...
106
click to vote
TLCA
2007
Springer
15 years 5 months ago
2007
Springer
We propose type systems that abstractly interpret small-step rather than big-step operational semantics. We treat an expression or evaluation context as a structure in a linear log...