Well-Founded Semantics for Logic Programs with Aggregates: Implementation and Experimentation Mario Alviano, Wolfgang Faber, and Nicola Leone Department of Mathematics University of CalabriaRende (CS), Italy

Source URL: ceur-ws.org

• Logic programming
• Mathematical logic
• Theoretical computer science
• Logic
• Order theory
• Model theory
• Stable model semantics
• Path ordering
• Negation as failure
• FO

Local Closed World Reasoning with Description Logics under the Well-Founded Semantics Matthias Knorra,∗, Jos´e J´ ulio Alferesa,1 , Pascal Hitzlerb,2 a CENTRIA,

Source URL: daselab.cs.wright.edu

Well-founded Recursion over Contextual Objects Brigitte Pientka1 and Andreas Abel2 1 2

Source URL: www2.tcs.ifi.lmu.de

• Functions and mappings
• Model theory
• Computability theory
• Interpretation
• Philosophy of mind
• Semantics
• Primitive recursive function
• Function
• First-order logic
• Mathematical logic
• Mathematics
• Logic

Technical Communications of the International Conference on Logic Programming, 2010 (Edinburgh), pp. 134–143 http://www.floc-conference.org/ICLP-home.html TIGHT SEMANTICS FOR LOGIC PROGRAMS LUÍS MONIZ PEREIRA 1 AND AL

Source URL: drops.dagstuhl.de

• Theoretical computer science
• Stable model semantics
• Modal logic
• Answer set programming
• Semantics
• Well-founded semantics
• Logic programming
• Logic
• Science

A Well-founded Semantics for Hybrid MKNF Knowledge Bases? Matthias Knorr1 , Jos´e J´ ulio Alferes1 , and Pascal Hitzler2 1

Source URL: www.ceur-ws.org

• Modal logic
• Logic programming
• Artificial intelligence
• Non-classical logic
• Model theory
• Stable model semantics
• Epistemic modal logic
• Partition
• Description logic
• Mathematics
• Mathematical logic
• Logic