Pages that link to "Item:Q3579631"

The following pages link to Reconciling description logics and rules (Q3579631):

Displaying 30 items.

• Evaluating epistemic negation in answer set programming (Q286399) (← links)
• Data repair of inconsistent nonmonotonic description logic programs (Q322065) (← links)
• From description-logic programs to multi-context systems (Q516031) (← 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)
• Semantic characterization of rational closure: from propositional logic to description logics (Q898736) (← links)
• On updates of hybrid knowledge bases composed of ontologies and rules (Q900304) (← links)
• Extended RDF: computability and complexity issues (Q905991) (← links)
• Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin (Q1653439) (← links)
• Three-valued semantics for hybrid MKNF knowledge bases revisited (Q1677437) (← links)
• Reactive multi-context systems: heterogeneous reasoning in dynamic environments (Q1748467) (← links)
• Enhancing context knowledge repositories with justifiable exceptions (Q1749389) (← links)
• Active integrity constraints for general-purpose knowledge bases (Q1783734) (← links)
• Tractable reasoning using logic programs with intensional concepts (Q2055806) (← links)
• A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure (Q2224833) (← 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)
• Typicalities and probabilities of exceptions in nonmotonic description logics (Q2329599) (← 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)
• A Unifying Perspective on Knowledge Updates (Q2915086) (← links)
• Normative Systems Represented as Hybrid Knowledge Bases (Q3092311) (← links)
• Linking Open-World Knowledge Bases Using Nonmonotonic Rules (Q3449214) (← links)
• Logic Programming with Graded Modality (Q3449234) (← links)
• Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT (Q6063882) (← links)
• Defeasible RDFS via rational closure (Q6490339) (← links)