Pages that link to "Item:Q3988060"

The following pages link to Logic Programming with Strong Negation and Inexact Predicates (Q3988060):

Displaying 20 items.

• Proof theory of Nelson's paraconsistent logic: a uniform perspective (Q764309) (← links)
• Gentzen-type methods for bilattice negation (Q813084) (← links)
• Non-classical negation in the works of Helena Rasiowa and their impact on the theory of negation (Q865046) (← links)
• Combining linear-time temporal logic with constructiveness and paraconsistency (Q975875) (← links)
• Phase semantics and Petri net interpretation for resource-sensitive strong negation (Q1006444) (← links)
• Informational interpretation of substructural propositional logics (Q1322438) (← links)
• Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
• Inconsistency-tolerant temporal reasoning with hierarchical information (Q1749966) (← links)
• Paraconsistent computation tree logic (Q1758667) (← links)
• Diamonds are a philosopher's best friends. The knowability paradox and modal epistemic relevance logic (Q1868338) (← links)
• A logic programming system for nonmonotonic reasoning (Q1891266) (← links)
• Semantics-based nonmonotonic inference (Q1903578) (← links)
• Linear and affine logics with temporal, spatial and epistemic operators (Q2368991) (← links)
• A rule based knowledge transaction model for mobile environments (Q2509213) (← links)
• A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics (Q2813672) (← links)
• Inconsistency-Tolerant Multi-Agent Calculus (Q3448622) (← links)
• N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure (Q3727349) (← links)
• Tableaux for logic programming with strong negation (Q4610313) (← links)
• Abduction over 3-valued extended logic programs (Q5101439) (← links)
• A variant of Thomason's first-order logic CF based on situations (Q5937807) (← links)