Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #101 to #150.

View ( | ) (20 | 50 | 100 | 250 | 500)

  1. On the Relationship Between Two Modular Action Languages: A Translation from MAD into $$\mathcal {ALM}$$: Label: en
  2. Infinitary Equilibrium Logic and Strong Equivalence: Label: en
  3. Combining Heuristics for Configuration Problems Using Answer Set Programming: Label: en
  4. Progress in clasp Series 3: Label: en
  5. ASP Solving for Expanding Universes: Label: en
  6. Reasoning with Forest Logic Programs Using Fully Enriched Automata: Label: en
  7. Diagnostic Reasoning for Robotics Using Action Languages: Label: en
  8. ASP, Amalgamation, and the Conceptual Blending Workflow: Label: en
  9. Linking Open-World Knowledge Bases Using Nonmonotonic Rules: Label: en
  10. Interactive Debugging of Non-ground ASP Programs: Label: en
  11. A New Computational Logic Approach to Reason with Conditionals: Label: en
  12. A Formal Theory of Justifications: Label: en
  13. Digital Forensics Evidence Analysis: An Answer Set Programming Approach for Generating Investigation Hypotheses: Label: en
  14. Knowledge Acquisition via Non-monotonic Reasoning in Distributed Heterogeneous Environments: Label: en
  15. Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams: Label: en
  16. Performance Tuning in Answer Set Programming: Label: en
  17. Implementing Preferences with asprin: Label: en
  18. A Framework for Goal-Directed Query Evaluation with Negation: Label: en
  19. Answer Set Programming Modulo Acyclicity: Label: en
  20. A Theory of Intentions for Intelligent Agents: Label: en
  21. “Add Another Blue Stack of the Same Height!”: ASP Based Planning and Plan Failure Analysis: Label: en
  22. aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming: Label: en
  23. Online Action Language $$o\mathcal {BC}$$+: Label: en
  24. Automated Inference of Rules with Exception from Past Legal Cases Using ASP: Label: en
  25. Integrating ASP into ROS for Reasoning in Robots: Label: en
  26. Improving Coordinated SMT-Based System Synthesis by Utilizing Domain-Specific Heuristics: Label: en
  27. Advances in WASP: Label: en
  28. Shift Design with Answer Set Programming: Label: en
  29. Relational and Semantic Data Mining: Label: en
  30. Algorithmic Decision Theory Meets Logic: Label: en
  31. Stable Models for Temporal Theories: Label: en
  32. Industrial-Size Scheduling with ASP+CP: Label: en
  33. An Application of Clasp in the Study of Logics: Label: en
  34. Transaction Logic with External Actions: Label: en
  35. New Semantics for Epistemic Specifications: Label: en
  36. Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence: Label: en
  37. Integrating Rules and Ontologies in the First-Order Stable Model Semantics (Preliminary Report): Label: en
  38. Parametrized Equilibrium Logic: Label: en
  39. Weight Constraints with Preferences in ASP: Label: en
  40. Contingency-Based Equilibrium Logic: Label: en
  41. Optimizing the Distributed Evaluation of Stratified Programs via Structural Analysis: Label: en
  42. Aggregates in Answer Set Optimization: Label: en
  43. Termination of Grounding Is Not Preserved by Strongly Equivalent Transformations: Label: en
  44. On Influence and Contractions in Defeasible Logic Programming: Label: en
  45. Partial Preferences and Ambiguity Resolution in Contextual Defeasible Logic: Label: en
  46. What Are the Necessity Rules in Defeasible Reasoning?: Label: en
  47. Back and Forth between Rules and SE-Models: Label: en
  48. Strong Equivalence of Logic Programs with Abstract Constraint Atoms: Label: en
  49. Dynamic Magic Sets for Programs with Monotone Recursive Aggregates: Label: en
  50. Stepping through an Answer-Set Program: Label: en

View ( | ) (20 | 50 | 100 | 250 | 500)