Relative expressiveness of defeasible logics
From MaRDI portal
Publication:4911149
DOI10.1017/S1471068412000294zbMath1260.68065arXiv1210.1785MaRDI QIDQ4911149
Publication date: 13 March 2013
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.1785
68N17: Logic programming
Related Items
Cites Work
- Unnamed Item
- A logic for default reasoning
- On the expressive power of programming languages
- Embedding as a tool for language comparison
- Computational complexity and constraint logic programming languages
- An inclusion theorem for defeasible logics
- What Are the Necessity Rules in Defeasible Reasoning?
- Representation results for defeasible logic
- Some (in)translatability results for normal logic programs and propositional theories
- The next 700 programming languages