Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
normal programs
Description:
Rule-based logic programs in which clauses have a single atom in the head and may contain negated atoms in the body.
Primary topic:
Logic, Reasoning, and Knowledge (72%)
Related topics:
Logic, Reasoning, and Knowledge (72%),
Logic, programming, and type systems (14%)
OpenAlex ID:
keywords/normal-programs
Partial evaluation in logic programming
1991
·
J.W. Lloyd
, J.C. Shepherdson
·
The Journal of Logic Programming
·
410
Efficient Implementation of the Well-founded and Stable Model Semantics
1996
·
Ilkka Niemelä
, Patrik Simons
·
JICSLP
·
176
Deductive databases and logic programming
1992
·
Subrata Das
·
Addison-Wesley eBooks
·
151
Extended stable semantics for normal and disjunctive programs
1990
·
Teodor C. Przymusiński
·
127
A completeness theorem for SLDNF resolution
1989
·
L. Cavedon
, J.W. Lloyd
·
The Journal of Logic Programming
·
71
Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs
2002
·
G. Brewka
, Ilkka Niemelä
, et al.
·
Lecture notes in computer science
·
68
What is failure? An approach to constructive negation
1995
·
Wlodzimierz Drabent
·
Acta Informatica
·
62
Stable models and difference logic
2008
·
Ilkka Niemelä
·
Annals of Mathematics and Artificial Intelligence
·
58
Generalizing updates: From models to programs
1998
·
JoÃo Alexandre Leite
, Luís Moniz Pereira
·
Lecture notes in computer science
·
56
Achieving compositionality of the stable model semantics for smodels programs
2008
·
EMILIA OIKARINEN
, TOMI JANHUNEN
·
Theory and Practice of Logic Programming
·
55
PDF
On the Semantics and Complexity of Probabilistic Logic Programs
2017
·
Fabio Gagliardi Cozman
, Denis Deratani Mauá
·
Journal of Artificial Intelligence Research
·
41
PDF
The distribution semantics for normal programs with function symbols
2016
·
Fabrizio Riguzzi
·
International Journal of Approximate Reasoning
·
38
On finitely recursive programs
2009
·
SABRINA BASELICE
, PIERO A. BONATTI
, et al.
·
Theory and Practice of Logic Programming
·
36
PDF
Preserving Strong Equivalence while Forgetting
2014
·
Matthias Knorr
, José Julio Alferes
·
Lecture notes in computer science
·
31
A Completeness Result for SLDNF-Resolution
1993
·
Karl Stroetmann
·
The Journal of Logic Programming
·
28
Update-programms can update programs
1997
·
José Júlio Alferes
, Luís Moniz Pereira
·
Lecture notes in computer science
·
26
Ground Nonmonotonic Modal Logic S5: New Results
2005
·
Mauricio Osorio Galindo
, Juan Antonio Navarro Pérez
, et al.
·
Journal of Logic and Computation
·
24
Transforming normal programs by replacement
1992
·
Annalisa Bossi
, Nicoletta Cocco
, et al.
·
Lecture notes in computer science
·
24
Combining explicit negation and negation by failure via Belnap's logic
1997
·
Paul Ruet
, François Fages
·
Theoretical Computer Science
·
19
PDF
Backdoors to Normality for Disjunctive Logic Programs
2013
·
Johannes Fichte
, Stefan Szeider
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
18
Backdoors to Normality for Disjunctive Logic Programs
2013
·
Fichte, Johannes Klaus
, Szeider, Stefan
·
arXiv (Cornell University)
·
17
PDF
Simultaneous Replacement in Normal Programs
1996
·
ANNALISA BOSSI
, NICOLETTA COCCO
, et al.
·
Journal of Logic and Computation
·
15
PDF
On negation in Hilog
1994
·
Kenneth A Ross
·
The Journal of Logic Programming
·
15
PDF
Transforming acyclic programs
1994
·
Annalisa Bossi
, Sandro Etalle
·
ACM Transactions on Programming Languages and Systems
·
13
PDF
Enhancing Linear Algebraic Computation of Logic Programs Using Sparse Representation
2021
·
Tuan Quoc Nguyen
, Katsumi Inoue
, et al.
·
New Generation Computing
·
12
PDF
Show more works
View as search
Works count:
99
Citation count:
1,790
Year
Topic
Type