Pages that link to "Item:Q2389666"

The following pages link to Combining answer set programming with description logics for the semantic web (Q2389666):

Displaying 50 items.

• Domain expansion for ASP-programs with external sources (Q254002) (← links)
• Evaluating epistemic negation in answer set programming (Q286399) (← links)
• Data repair of inconsistent nonmonotonic description logic programs (Q322065) (← links)
• A framework for modular ERDF ontologies (Q360258) (← links)
• Tightly integrated probabilistic description logic programs for representing ontology mappings (Q429437) (← links)
• From description-logic programs to multi-context systems (Q516031) (← links)
• Loop-separable programs and their first-order definability (Q543631) (← links)
• FO(ID) as an extension of DL with rules (Q604911) (← links)
• Local closed world reasoning with description logics under the well-founded semantics (Q646502) (← links)
• The loop formula based semantics of description logic programs (Q764312) (← links)
• Combining event calculus and description logic reasoning via logic programming (Q831926) (← links)
• Conceptual logic programs (Q854977) (← links)
• Open answer set programming for the semantic web (Q881833) (← links)
• Extended RDF: computability and complexity issues (Q905991) (← links)
• Description logic programs under probabilistic uncertainty and fuzzy vagueness (Q962902) (← links)
• Probabilistic description logic programs (Q997050) (← links)
• Exploiting conjunctive queries in description logic programs (Q1028641) (← links)
• Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin (Q1653439) (← links)
• Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\) (Q1653445) (← links)
• Reactive multi-context systems: heterogeneous reasoning in dynamic environments (Q1748467) (← links)
• Enhancing context knowledge repositories with justifiable exceptions (Q1749389) (← links)
• Fixed point semantics for stream reasoning (Q2046012) (← links)
• Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
• Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (Q2302291) (← links)
• A formal model of semantic computing (Q2318288) (← links)
• Supportedly stable answer sets for logic programs with generalized atoms (Q2360180) (← links)
• Integrity constraints in OWL ontologies based on grounded circumscription (Q2418659) (← links)
• FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
• Towards provenance in heterogeneous knowledge bases (Q2694577) (← links)
• Flexible Approximators for Approximating Fixpoint Theory (Q2814522) (← links)
• Simulating Production Rules Using ACTHEX (Q2900521) (← links)
• Stepwise Debugging of Description-Logic Programs (Q2900544) (← links)
• Well-Supported Semantics for Logic Programs with Generalized Rules (Q2900549) (← links)
• Anytime Computation of Cautious Consequences in Answer Set Programming (Q2931278) (← links)
• Linking Open-World Knowledge Bases Using Nonmonotonic Rules (Q3449214) (← links)
• Description Logic Programs Under Probabilistic Uncertainty and Fuzzy Vagueness (Q3524929) (← links)
• The role of semantics in mining frequent patterns from knowledge bases in description logics with rules (Q3577710) (← links)
• Loop formulas for description logic programs (Q3585166) (← links)
• Realizing Default Logic over Description Logic Knowledge Bases (Q3638182) (← links)
• Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web (Q3638227) (← links)
• On Coherence and Consistence in Fuzzy Answer Set Semantics for Residuated Logic Programs (Q3638391) (← links)
• Answer Set Programming: A Primer (Q3638997) (← links)
• Combining Nonmonotonic Knowledge Bases with External Sources (Q3655190) (← links)
• Combining Description Logics, Description Graphs, and Rules (Q3655191) (← links)
• Cautious reasoning in ASP via minimal models and unsatisfiable cores (Q4559795) (← links)
• On the relation between SPARQL1.1 and Answer Set Programming (Q4583314) (← links)
• Rewriting recursive aggregates in answer set programming: back to monotonicity (Q4592997) (← links)
• Complexity and compilation of GZ-aggregates in answer set programming (Q4592998) (← links)
• Modular action language (Q4593024) (← links)
• A model building framework for answer set programming with external computations (Q4593036) (← links)