The Alternating Fixpoint of Logic Programs With Negation

doi 10.1145/73721.73722
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs

Theory and Practice of Logic Programming
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceArtificial IntelligenceSoftware
2018English

Paraconsistent Negation and Classical Negation in Computation Tree Logic

2010English

Paraconsistent Logic and Weakening of Intuitionistic Negation

Journal of Intelligent Systems
Information SystemsArtificial IntelligenceSoftware
2012English

Alternating-Time Temporal Logic

Computer Standards and Interfaces
HardwareLawArchitectureSoftware
1999English

Logic Programs With Refutation Rules

1994English

The Difficulties of Learning Logic Programs With Cut

Journal of Artificial Intelligence Research
Artificial Intelligence
1993English

On the Semantics of Logic Programs With Preferences

Journal of Artificial Intelligence Research
Artificial Intelligence
2007English

Extending Logic Programs With Description Logic Expressions for the Semantic Web

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

On Two Fragments With Negation and Without Implication of the Logic of Residuated Lattices

Archive for Mathematical Logic
PhilosophyLogic
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy