Sciweavers

1638 search results - page 83 / 328
» A General Semantics for Evaluation Logic
Sort
View
ASP
2005
Springer
15 years 3 months ago
Nelson's Strong Negation, Safe Beliefs and the Answer Set Semantics
In this paper we consider an extension of the answer set semantics allowing arbitrary use of strong negation. We prove that the strong negation extension of any intermediate logic ...
Magdalena Ortiz, Mauricio Osorio
TABLEAUX
2009
Springer
15 years 2 months ago
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
Luis Pinto, Tarmo Uustalu
DLOG
2007
15 years 8 days ago
Exploiting Conjunctive Queries in Description Logic Programs
We present cq-programs, which enhance nonmonotonic description logics (dl-) programs by conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics kno...
Thomas Eiter, Giovambattista Ianni, Thomas Krennwa...
IWFM
2000
112views Formal Methods» more  IWFM 2000»
14 years 11 months ago
A Note on the Relationships Between Logic Programs and Neural Networks
Several recent publications have exhibited relationships between the theories of logic programming and of neural networks. We consider a general approach to representing normal lo...
Pascal Hitzler, Anthony Karel Seda
AI
2006
Springer
14 years 10 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo