778 search results - page 95 / 156 » Expressiveness and complexity of graph logic |
96
Voted
AI
2005
Springer
15 years 11 days ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
119
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
94
Voted
WWW
2004
ACM
16 years 1 months ago
2004
ACM
Although the OWL Web Ontology Language adds considerable expressive power to the Semantic Web it does have expressive limitations, particularly with respect to what can be said ab...
124
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...
110
Voted
LPAR
2004
Springer
15 years 5 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...