Preference Logic Grammars: Fixed point semantics and application to data standardization

DOI10.1016/S0004-3702(02)00185-6zbMath0995.68024OpenAlexW1986318362MaRDI QIDQ1603737

Baoqiu Cui, Terrance Swift

Publication date: 15 July 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00185-6

zbMATH Keywords

natural language processingnon-monotonic reasoninglogic Programmingreasoning with preferencesXSB

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17) Natural language processing (68T50)

Related Items (3)

XSB: Extending Prolog with Tabled Logic Programming ⋮ Logic programming with solution preferences ⋮ Logic programming and knowledge representation---The A-Prolog perspective

Uses Software

• YAP-Prolog
• XSB

Cites Work

• Preferred answer sets for extended logic programs
• Tabling for non-monotonic programming
• Principles and implementation of deductive parsing
• The well-founded semantics for general logic programs
• Preference logic grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Preference Logic Grammars: Fixed point semantics and application to data standardization