scientific article; zbMATH DE number 1926616

zbMath1012.68507MaRDI QIDQ4707748

Dietmar Seipel, Jack Minker

Publication date: 11 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2407/24070472.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17)

Related Items (6)

Reasoning under minimal upper bounds in propositional logic ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ On measuring inconsistency in definite and indefinite databases with denial constraints ⋮ On combining ontologies and rules ⋮ Disjunctive databases for representing repairs ⋮ Disjunctive logic programs, answer sets, and the cut rule

Uses Software

• Smodels
• SATCHMO
• XSB

This page was built for publication: