Short proofs for tricky formulas
Acta Informatica
Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
Journal of Combinatorial Theory Series A
The complexity of facets resolved
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
The symmetry rule in propositional logic
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Annals of Mathematics and Artificial Intelligence
Information Processing Letters
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Theoretical Computer Science
NP-Completeness of Refutability by Literal-Once Resolution
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Homomorphisms of conjunctive normal forms
Discrete Applied Mathematics - The renesse issue on satisfiability
The Complexity of Homomorphisms and Renamings for Minimal Unsatisfiable Formulas
Annals of Mathematics and Artificial Intelligence
Graph Theory With Applications
Graph Theory With Applications
Graph-Based Domain Mapping for Transfer Learning in General Games
ECML '07 Proceedings of the 18th European conference on Machine Learning
| Hi-index | 0.00 |
A homomorphism ϕ of logic programs from P to P' is a function mapping Atoms(P) to Atoms(P') and it preserves complements and program clauses. For each definite program clause a ← a1,...,an ∈ P it implies that ϕ(a) ← ϕ(a1),..., ϕ(an) is a program clause of P'. A homomorphism ϕ is an isomorphism if ϕ is a bijection. In this paper, the complexity of the decision problems on homomorphism and isomorphism for definite logic programs is studied. It is shown that the homomorphism problem (HOM-LP) for definite logic programs is NP-complete, and the isomorphism problem (ISO-LP) is equivalent to the graph isomorphism problem (GI).