725 search results - page 53 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
128
click to vote
DAGSTUHL
2003
15 years 4 months ago
2003
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...
134
Voted
IJAR
2010
15 years 1 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
121
Voted
ICLP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
115
Voted
SLP
1993
15 years 4 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
138
Voted
ICFP
1999
ACM
15 years 7 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...