Pages that link to "Item:Q3983043"
From MaRDI portal
The following pages link to Classical negation in logic programs and disjunctive databases (Q3983043):
Displaying 50 items.
- External sources of knowledge and value invention in logic programming (Q2457798) (← links)
- An introduction to fuzzy answer set programming (Q2457803) (← links)
- Inferring phylogenetic trees using answer set programming (Q2467563) (← links)
- Connectionist computations of intuitionistic reasoning (Q2503271) (← links)
- A rule based knowledge transaction model for mobile environments (Q2509213) (← links)
- Any-world assumptions in logic programming (Q2566297) (← links)
- Multi-modal nonmonotonic logics of minimal knowledge (Q2642626) (← links)
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach (Q2642629) (← links)
- A characterization of answer sets for logic programs (Q2644415) (← links)
- On the negation of a Dempster-Shafer belief structure based on maximum uncertainty allocation (Q2660901) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- State transition in multi-agent epistemic domains using answer set programming (Q2694576) (← links)
- Towards causality-based conflict resolution in answer set programs (Q2694586) (← links)
- Solving problems in the polynomial hierarchy with ASP(Q) (Q2694590) (← links)
- DeduDeep: an extensible framework for combining deep learning and ASP-based models (Q2694622) (← links)
- Exploiting Contextual Knowledge for Hybrid Classification of Visual Objects (Q2835873) (← links)
- Writing Declarative Specifications for Clauses (Q2835876) (← links)
- Rule-based Stream Reasoning for Intelligent Administration of Content-Centric Networks (Q2835897) (← links)
- Measuring Inconsistency in Answer Set Programs (Q2835905) (← links)
- A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions (Q2900504) (← links)
- Parameterized Splitting: A Simple Modification-Based Approach (Q2900508) (← links)
- Simulating Production Rules Using ACTHEX (Q2900521) (← links)
- The Intelligent Grounder of DLV (Q2900523) (← links)
- Toward Question Answering in Travel Domains (Q2900529) (← links)
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences (Q2900530) (← links)
- Applying Visible Strong Equivalence in Answer-Set Program Transformations (Q2900532) (← links)
- Reformulating Action Language $\mathcal{C}$ + in Answer Set Programming (Q2900536) (← links)
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming (Q2900538) (← links)
- Disjunctive Programs with Set Constraints (Q2900542) (← links)
- Stepwise Debugging of Description-Logic Programs (Q2900544) (← links)
- A Language for Default Reasoning about Actions (Q2900546) (← links)
- Connecting First-Order ASP and the Logic FO(ID) through Reducts (Q2900547) (← links)
- A New Incarnation of Action Language H (Q2900548) (← links)
- Well-Supported Semantics for Logic Programs with Generalized Rules (Q2900549) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Inconsistency Management for Traffic Regulations: Formalization and Complexity Results (Q2915061) (← links)
- The View-Update Problem for Indefinite Databases (Q2915065) (← links)
- Exploiting Unfounded Sets for HEX-Program Evaluation (Q2915067) (← links)
- A Selective Semantics for Logic Programs with Preferences (Q2915073) (← links)
- Preserving Strong Equivalence while Forgetting (Q2938510) (← links)
- Modular Paracoherent Answer Sets (Q2938513) (← links)
- LoCo—A Logic for Configuration Problems (Q2946729) (← links)
- Handling Exceptions in Logic Programming without Negation as Failure (Q3011970) (← links)
- Abduction-Based Search for Cooperative Answers (Q3092304) (← links)
- Negation and minimality in disjunctive databases (Q3125092) (← links)
- Advances in WASP (Q3449189) (← links)
- Digital Forensics Evidence Analysis: An Answer Set Programming Approach for Generating Investigation Hypotheses (Q3449208) (← links)
- A Formal Theory of Justifications (Q3449209) (← links)
- Interactive Debugging of Non-ground ASP Programs (Q3449213) (← links)
- On the Relationship Between Two Modular Action Languages: A Translation from MAD into $$\mathcal {ALM}$$ (Q3449224) (← links)
