Pages that link to "Item:Q3750144"
From MaRDI portal
The following pages link to Quantitative deduction and its fixpoint theory (Q3750144):
Displaying 50 items.
- Game semantics for non-monotonic intensional logic programming (Q345702) (← links)
- A game semantics for disjunctive logic programming (Q388214) (← links)
- A core language for fuzzy answer set programming (Q448947) (← links)
- Focused most probable world computations in probabilistic logic programs (Q454145) (← links)
- Proximity-based unification theory (Q529054) (← links)
- A note on the model-theoretic semantics of fuzzy logic programming for dealing with inconsistency (Q598579) (← links)
- Proof and refutation in MALL as a game (Q636305) (← links)
- Multi-valued logic programming semantics An algebraic approach (Q673383) (← links)
- Answering queries from context-sensitive probabilistic knowledge bases (Q673387) (← links)
- A logic for reasoning with inconsistency (Q688558) (← links)
- A top-\(k\) query answering procedure for fuzzy logic programming (Q695268) (← links)
- Programming in three-valued logic (Q753474) (← links)
- Aggregated fuzzy answer set programming (Q766043) (← links)
- Tabulation proof procedures for fuzzy linguistic logic programming (Q899133) (← links)
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
- Probabilistic logic programming (Q1207942) (← links)
- Paraconsistent logic programming (Q1262746) (← links)
- A semantical framework for supporting subjective and conditional probabilities in deductive databases (Q1311410) (← links)
- Probabilistic Horn abduction and Bayesian networks (Q1313950) (← links)
- Annotated fuzzy logic programs (Q1568489) (← links)
- Annotated revision programs (Q1603740) (← links)
- Fixpoint semantics for logic programming a survey (Q1605173) (← links)
- Approximate reasoning by similarity-based SLD resolution. (Q1607217) (← links)
- Semantic probabilistic inference of predictions (Q1709106) (← links)
- An encompassing framework for paraconsistent logic programs (Q1775864) (← links)
- Learning any memory-less discrete semantics for dynamical systems represented by logic programs (Q2102410) (← links)
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
- Termination of logic programs with imperfect information: applications and query procedure (Q2372195) (← links)
- Thresholded semantic framework for a fully integrated fuzzy logic language (Q2409628) (← links)
- Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds (Q2426104) (← links)
- An infinite-game semantics for well-founded negation in logic programming (Q2474440) (← links)
- A system of quantificational deduction (Q2531612) (← links)
- A new approach to hybrid probabilistic logic programs (Q2642628) (← links)
- Qualified logic programming with bivalued predicates (Q2808238) (← links)
- Semantics for possibilistic disjunctive programs (Q2845121) (← links)
- XSB: extending Prolog with tabled logic programming (Q2893097) (← links)
- From Fuzzy to Annotated Semantic Web Languages (Q2970305) (← links)
- Beyond multi-adjoint logic programming (Q3451409) (← links)
- Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness (Q3532471) (← links)
- A declarative semantics for CLP with qualification and proximity (Q3585172) (← links)
- Optimizing Fixpoint Evaluation of Logic Programs with Uncertainty (Q3628499) (← links)
- (Q3786010) (← links)
- (Q4511297) (← links)
- Knowledge, Uncertainty and Ignorance in Logic: Bilattices and beyond (Q4531578) (← links)
- Fixed Points In Quantitative Semantics (Q4635890) (← links)
- Using Histograms to Better Answer Queries to Probabilistic Logic Programs (Q4649723) (← links)
- (Q4926910) (← links)
- Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs (Q4982058) (← links)
- Exploiting Game Theory for Analysing Justifications (Q5140022) (← links)
- (Q5354752) (← links)