OpenAlex | Recurrence with affine level mappings is P-time decidable for CLP

Recurrence with affine level mappings is P-time decidable for CLP

Work

Year: 2007

Type: article

Source: Theory and Practice of Logic Programming

Authors Fred Mesnard, Alexander Serebrenik

Institutions University of Reunion Island, Quality Systems (United States)

Cites: 26

Cited by: 18

Related to: 10

FWCI: 2.116

Citation percentile (by year/subfield): 88.11

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed