2585 search results - page 479 / 517 » Automating Coherent Logic |
125
Voted
ASP
2005
Springer
15 years 6 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...
ECSQARU
2005
Springer
15 years 6 months ago
2005
Springer
Conditional deduction in binary logic basically consists of deriving new statements from an existing set of statements and conditional rules. Modus Ponens, which is the classical e...
103
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
105
click to vote
ICLP
2005
Springer
15 years 6 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...
103
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
The Semantic Web is a rapidly growing research area aiming at the exchange of semantic information over the World Wide Web. The Semantic Web is built on top of RDF, an XML-based ex...