ScholarLens Back to search
2005•Acta Scientiarum Naturalium Universitatis SunyatseniRequires access

Complexities of Homomorphism and Isomorphism for Definite Logic Programs

许道云, 陶志红

Open publisher page 0 citations

Abstract

A homomorphism ψ of logic programs from P to P' is a function mapping Atoms(P) to Atoms(P') and 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).

About this research paper

What this paper is about

A homomorphism ψ of logic programs from P to P' is a function mapping Atoms(P) to Atoms(P') and 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).

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A homomorphism ψ of logic programs from P to P' is a function mapping Atoms(P) to Atoms(P') and 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).

Key concepts: Homomorphism, Graph homomorphism, Isomorphism (crystallography), Induced subgraph isomorphism problem, Graph isomorphism, Mathematics, Discrete mathematics, Algebra homomorphism

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Complexities of Homomorphism and Isomorphism for Definite Logic Programs — Research Paper | ScholarLens