The possibilistic Horn non-clausal knowledge bases
From MaRDI portal
Publication:2105624
Cites work
- A crash course on generalized possibilistic logic
- A first polynomial non-clausal class in many-valued logic
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- A Non-clausal Connection Calculus
- A non-clausal tableau calculus for \textsc{MinSat}
- A solver for QBFs in negation normal form
- A tableau calculus for non-clausal maximum satisfiability
- An alternative proof method for possibilistic logic and its application to terminological logics
- Answer set programming
- Certification of nonclausal connection tableaux proofs
- Combining SAT methods with non-clausal decision heuristics
- Compiling finite linear CSP into SAT
- Completely non-clausal theorem proving
- Dealing with explicit preferences and uncertainty in answer set programming
- Decomposable negation normal form
- Differential dynamic logic for hybrid systems
- Foundations of Rule-Based Query Answering
- Gelfond-Zhang aggregates as propositional formulas
- Generalized possibilistic logic: foundations and applications to qualitative reasoning about uncertainty
- scientific article; zbMATH DE number 1670773 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 695097 (Why is no real title available?)
- scientific article; zbMATH DE number 1076963 (Why is no real title available?)
- scientific article; zbMATH DE number 7015115 (Why is no real title available?)
- scientific article; zbMATH DE number 1416103 (Why is no real title available?)
- scientific article; zbMATH DE number 956858 (Why is no real title available?)
- Inferring simple solutions to recursion-free Horn clauses via sampling
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Linearity and regularity with negation normal form
- Logic programs with propositional connectives and aggregates
- Mathematical Logic for Computer Science
- Necessity Measures and the Resolution Principle
- Nested Boolean functions as models for quantified Boolean formulas
- Nested expressions in logic programs
- Nested preferences in answer set programming
- Non-clausal connection calculi for non-classical logics
- On sentences which are true of direct unions of algebras
- On the complexity of entailment in propositional multivalued logics
- On the expressive power of multiple heads in CHR
- Possibilistic logic: a retrospective and prospective view
- Possibilistic logic: Complexity and algorithms
- Possibilistic nested logic programs
- Possibilistic nested logic programs and strong equivalence
- Possibilistic uncertainty handling for answer set programming
- Principles and Practice of Constraint Programming – CP 2004
- Resolution principles in possibilistic logic
- Resolution theorem proving
- SAT-solving in practice, with a tutorial example from supervisory control
- Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions
- Semantics for Possibilistic Disjunctive Programs
- Semantics for possibilistic disjunctive programs
- Simplification of many-valued logic formulas using anti-links
- Subgoaling techniques for satisficing and optimal numeric planning
- The decision problem for some classes of sentences without quantifiers
- Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification: a comparative description
- Unification as a complexity measure for logic programming
- Using possibilistic logic for modeling qualitative decision: answer set programming algorithms
- Weight constraints as nested expressions
This page was built for publication: The possibilistic Horn non-clausal knowledge bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105624)
