393 search results - page 46 / 79 » Logic Programs with Classical Negation |
PLANX
2007
13 years 10 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
LPKR
1997
Springer
14 years 20 days ago
1997
Springer
Abstract. Recently the field of theory update has seen some improvement, in what concerns model updating, by allowing updates to be specified by so-called revision programs. The ...
ECAI
1992
Springer
14 years 18 days ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...