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

scientific article

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

zbMath0991.03036MaRDI QIDQ2751371

Jürgen Dix, Ulrich Furbach, Ilkka Niemelä

Publication date: 29 August 2002


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

zbMATH Keywords

artificial intelligenceautoepistemic logicdefault logicimplementationlogic programmingcircumscriptionnonmonotonic logicsrational closure


Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35) Logic programming (68N17)


Related Items (8)

Model checking multi-agent systems with logic based Petri nets ⋮ Proof complexity of propositional default logic ⋮ Heterogeneous active agents. III: Polynomially implementable agents ⋮ A general theory of confluent rewriting systems for logic programming and its applications ⋮ Nonmonotonicity in the framework of parametric logic ⋮ Explaining updates by minimal sums ⋮ Proof Complexity of Non-classical Logics ⋮ Relating defeasible and normal logic programming through transformation properties.


Uses Software

  • Smodels
  • SATCHMO
  • XSB



This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2751371&oldid=15621516"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki