Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
From MaRDI portal
Publication:4649731
DOI10.1007/978-3-642-02846-5_18zbMATH Open1251.68069OpenAlexW1810243429MaRDI QIDQ4649731FDOQ4649731
Authors: Mirosław Truszczyński 
Publication date: 13 November 2012
Published in: Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02846-5_18
Recommendations
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- scientific article; zbMATH DE number 1950451
- scientific article; zbMATH DE number 2095713
- A computable semantics for general logic programs
- Reduction of provability logics to \(\Sigma_1\)-provability logics
- A general relational semantics of propositional logic: axiomatization
- Generalized Quantifiers and Logical Reducibilities
- Logic for Programming, Artificial Intelligence, and Reasoning
- scientific article; zbMATH DE number 4195154
- On the declarative and procedural semantics of logic programs
Cites Work
- On the computational cost of disjunctive logic programming: Propositional case
- Nested expressions in logic programs
- Title not available (Why is that?)
- Logic Programming and Nonmonotonic Reasoning
- Strongly equivalent logic programs
- Logic programs with stable model semantics as a constraint programming paradigm
- Extending the Smodels system with cardinality and weight constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logics in Artificial Intelligence
- Hyperequivalence of logic programs with respect to supported models
- Logic programming and knowledge representation---The A-Prolog perspective
- Characterizations of the disjunctive stable semantics by partial evaluation
- Propositional theories are strongly equivalent to logic programs
Cited In (10)
- A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- On reduction rules, meaning-as-use, and proof-theoretic semantics
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
- Title not available (Why is that?)
- Applying Association Rules to ε-Reduction of Finite Theory in Two-Valued Propositional Logic
- On Relating Theories: Proof-Theoretical Reduction
- Propositional Compilation for All Normal Parameter Reductions of a Soft Set
- Title not available (Why is that?)
- Stable models of fuzzy propositional formulas
Uses Software
This page was built for publication: Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649731)
