Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
A Tableau Calculus for Equilibrium Entailment
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Annals of Mathematics and Artificial Intelligence
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
A reductive semantics for counting and choice in answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Discovering classes of strongly equivalent logic programs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Complexity of rule redundancy in non-ground answer-set programming over finite domains
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
A characterization of strong equivalence for logic programs with variables
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Quantified equilibrium logic and hybrid rules
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Reducing propositional theories in equilibrium logic to logic programs
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Loop-separable programs and their first-order definability
Artificial Intelligence
Theory and Practice of Logic Programming
Functional answer set programming
Theory and Practice of Logic Programming
Synonymous theories and knowledge representations in answer set programming
Journal of Computer and System Sciences
Interpolable formulas in equilibrium logic and answer set programming
Journal of Artificial Intelligence Research
Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains
ACM Transactions on Computational Logic (TOCL)
Connecting first-order ASP and the logic FO(ID) through reducts
Correct Reasoning
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.00 |
QHT is a first-order super-intuitionistic logic that provides afoundation for answer set programming (ASP) and a useful tool foranalysing and transforming non-ground programs. We recall someproperties of QHT and its nonmonotonic extension, quantifiedequilibrium logic (QEL). We show how the proof theory of QHT can beused to extend to non-ground programs previous results on thecompleteness of θ-subsumption. We also establish a reductionof QHT to classical logic and show how this can be used to obtainand extend classical encodings for concepts such as the strongequivalence of programs and theories. We pay special attention to aclass of general (disjunctive) logic programs that capture alluniversal theories in QEL.