19 search results - page 4 / 4 » The Alternating Fixpoint of Logic Programs with Negation |
90
Voted
ASP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
104
click to vote
PLANX
2007
14 years 11 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...
88
Voted
IFIP
2009
Springer
14 years 7 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
91
Voted
EPIA
2007
Springer
15 years 3 months ago
2007
Springer
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...