Sciweavers

382 search results - page 4 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
AAAI
2006
13 years 9 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
IJAR
2008
129views more  IJAR 2008»
13 years 7 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...
FSTTCS
2010
Springer
13 years 5 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
ICALP
2009
Springer
14 years 7 days ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn
POPL
2004
ACM
14 years 8 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford