The possibilistic Horn non-clausal knowledge bases
From MaRDI portal
Publication:2105624
DOI10.1016/j.ijar.2022.11.002OpenAlexW3214197239MaRDI QIDQ2105624
Publication date: 8 December 2022
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.07648
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Possibilistic logic: a retrospective and prospective view
- Linearity and regularity with negation normal form
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- Compiling finite linear CSP into SAT
- SAT-solving in practice, with a tutorial example from supervisory control
- Possibilistic uncertainty handling for answer set programming
- Resolution principles in possibilistic logic
- A solver for QBFs in negation normal form
- Differential dynamic logic for hybrid systems
- Completely non-clausal theorem proving
- An alternative proof method for possibilistic logic and its application to terminological logics
- On the complexity of entailment in propositional multivalued logics
- Generalized possibilistic logic: foundations and applications to qualitative reasoning about uncertainty
- Non-clausal connection calculi for non-classical logics
- Dealing with explicit preferences and uncertainty in answer set programming
- Nested expressions in logic programs
- Certification of nonclausal connection tableaux proofs
- A tableau calculus for non-clausal maximum satisfiability
- A non-clausal tableau calculus for \textsc{MinSat}
- Possibilistic nested logic programs and strong equivalence
- Using possibilistic logic for modeling qualitative decision: answer set programming algorithms
- Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions
- Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification
- Semantics for Possibilistic Disjunctive Programs
- Mathematical Logic for Computer Science
- Logic programs with propositional connectives and aggregates
- On the Expressive Power of Multiple Heads in CHR
- A Non-clausal Connection Calculus
- Foundations of Rule-Based Query Answering
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Unification as a complexity measure for logic programming
- Necessity Measures and the Resolution Principle
- Simplification of many-valued logic formulas using anti-links
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Weight constraints as nested expressions
- Subgoaling Techniques for Satisficing and Optimal Numeric Planning
- Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling
- Answer Set Programming
- Nested Boolean Functions as Models for Quantified Boolean Formulas
- Semantics for Possibilistic Disjunctive Programs
- Decomposable negation normal form
- On sentences which are true of direct unions of algebras
- The decision problem for some classes of sentences without quantifiers
- Principles and Practice of Constraint Programming – CP 2004
- Gelfond-Zhang aggregates as propositional formulas
- A first polynomial non-clausal class in many-valued logic
- A crash course on generalized possibilistic logic
