Decidable subsets of open logic and an algorithm for R-calculus
From MaRDI portal
Publication:2515454
DOI10.1007/s11432-014-5149-xzbMath1318.03037OpenAlexW2280771374MaRDI QIDQ2515454
Publication date: 5 August 2015
Published in: Science China. Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-014-5149-x
Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \textbf{R}-calculus without the cut rule
- An algorithm to compute maximal contractions for Horn clauses
- On the decidability of open logic
- A programmable approach to revising knowledge bases
- Dominoes and the complexity of subclasses of logical theories
- On the logic of iterated belief revision
- An open logic system
- Turing-machines and the Entscheidungsproblem
- ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
- Dynamic logic for belief revision
- On the logic of theory change: Partial meet contraction and revision functions
- Mathematical logic. Foundations for information science
- The classical decision problem.
This page was built for publication: Decidable subsets of open logic and an algorithm for R-calculus
