3032 search results - page 338 / 607 » Description Logic Rules |
121
click to vote
APAL
1999
15 years 3 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
128
Voted
JAPLL
2010
14 years 10 months ago
2010
We present a decision procedure for hybrid logic equipped with nominals, the satisfaction operator and existential, difference, converse, reflexive, symmetric and transitive modal...
201
click to vote
SOFSEM
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...
154
click to vote
ASP
2005
Springer
15 years 9 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
143
click to vote
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...