Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On logical constraints in logic programming

From MaRDI portal
Publication:5101440
Jump to:navigation, search

DOI10.1007/3-540-59487-6_4zbMath1497.68460OpenAlexW1499277620MaRDI QIDQ5101440

Anil Nerode, Victor W. Marek, Jeffery B. Remmel

Publication date: 30 August 2022

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.9095


Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)



Uses Software

  • CHIP


Cites Work

  • Unnamed Item
  • A logic for default reasoning
  • Stable and extension class theory for logic programs and default logics
  • The recursion-theoretic complexity of the semantics of predicate logic as a programming language
  • The Semantics of Predicate Logic as a Programming Language
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5101440&oldid=19613796"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 14:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki