Foundations of logic programming
Foundations of logic programming
Journal of Logic Programming
Journal of Logic Programming
Foundations of deductive databases and logic programming
Modeling simultaneous events with default reasoning and tight derivations
Journal of Logic Programming - Logic programming applications
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Every logic program has a natural stratification and an iterated least fixed point model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A procedural semantics for well founded negation in logic programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A logic for object-oriented logic programming
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
On negation in HiLog (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deductive databases: achievements and future directions
ACM SIGMOD Record - Directions for future database research & development
On the relationship between circumscription and well-founded semantics of logic programs
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
An alternating fixpoint tailored to magic programs
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the power of algebras with recursion
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A three-valued semantics for deductive databases and logic programs
Journal of Computer and System Sciences
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Providing semantics for indefinite deductive databases
Proceedings of the seventh international conference on Information and knowledge management
Three-valued formalization of logic programming: is it needed?
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of the logic programming semantics (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Succinct model semantics: a simple model for inclusive interpretations
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
The BLM semantics may be inconsistent
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
An Extension to GCWA and Query Evaluation for Disjunctive Deductive Databases
Journal of Intelligent Information Systems
Introduction to logic-based artificial intelligence
Logic-based artificial intelligence
Annals of Mathematics and Artificial Intelligence
Logic knowledge bases with two default rules
Annals of Mathematics and Artificial Intelligence
Using clausal deductive databases for defining semantics in disjunctive deductive databases
Annals of Mathematics and Artificial Intelligence
Using Extended Logic Programming for Alarm-Correlation in Cellular Phone Networks
Applied Intelligence
‘Classical’ Negation in Nonmonotonic Reasoning and Logic Programming
Journal of Automated Reasoning
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
Combining Multiple Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
High-Level Petri Net Model of Logic Program with Negation
IEEE Transactions on Knowledge and Data Engineering
WFS + Branch and Bound = Stable Models
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
A Deductive Environment for Dealing with Objects and Nonmonotonic Reasoning
IEEE Transactions on Knowledge and Data Engineering
Production Systems with Negation as Failure
IEEE Transactions on Knowledge and Data Engineering
Relating defeasible and normal logic programming through transformation properties
Theoretical Computer Science
A Possible World Semantics for Disjunctive Databases
IEEE Transactions on Knowledge and Data Engineering
Computing and Comparing Semantics of Programs in Four-Valued Logics
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Qualified Answers That Reflect User Needs and Preferences
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Clausal Deductive Databases and a General Framework for Semantics in Disjunctive Deductive Databases
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Capturing Stationary and Regular Extensions with Reiter's Extensions
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
An Efficient Argumentation Framework for Negtiating Autonomous Agents
MAAMAW '99 Proceedings of the 9th European Workshop on Modelling Autonomous Agents in a Multi-Agent World: MultiAgent System Engineering
Hypothesis Support for Information Integration in Four-Valued Logics
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Logic-based specification languages for intelligent software agents
Theory and Practice of Logic Programming
Consistent query answering under inclusion dependencies
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
Preferred answer sets for ordered logic programs
Theory and Practice of Logic Programming
DisLoP: a research project on Disjunctive Logic Programming
AI Communications
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
From SPARQL to rules (and back)
Proceedings of the 16th international conference on World Wide Web
MulVAL: a logic-based network security analyzer
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
An introduction to fuzzy answer set programming
Annals of Mathematics and Artificial Intelligence
Twelve Definitions of a Stable Model
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Specifying active databases as non-Markovian theories of actions
Journal of Intelligent Information Systems
An abductive framework for general logic programs and other nonmonotonic systems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 2
Logic programming in artificial intelligence
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Programming in autoepistemic logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Sound and efficient non-monotonic inference
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Well-founded semantics for hybrid rules
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
A generalization of the folding rule for the Clark-Kunen semantics
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Hybrid reasoning with rules and ontologies
Semantic techniques for the web
Production systems need negation as failure
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Knowledge representation and non-monotonic reasoning
A 25-year perspective on logic programming
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Thirteen definitions of a stable model
Fields of logic and computation
On the minimality of stable models
Logic programming, knowledge representation, and nonmonotonic reasoning
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Logic based authorization program and its implementation
Proceedings of the 4th international conference on Security of information and networks
Approximating answer sets of unitary lifschitz-woo programs
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Ambiguity propagating defeasible logic and the well-founded semantics
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Rules with contextually scoped negation
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
To vladimir lifschitz on his 65th birthday
Correct Reasoning
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
Qualifying Answers According to User Needs and Preferences
Fundamenta Informaticae
A Classification Theory Of Semantics Of Normal Logic Programs: I. Strong Properties
Fundamenta Informaticae
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
Semantics For Disjunctive Logic Programs With Explicit And Default Negation
Fundamenta Informaticae
Fundamenta Informaticae
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Inductive definitions in constraint programming
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.00 |
A general logic program (abbreviated to “program” hereafter) is a set of rules that have both positive and negative subgoals. It is common to view a deductive database as a general logic program consisting of rules (IDB) sitting above elementary relations (EDB, facts). It is desirable to associate one Herbrand model with a program and think of that model as the “meaning of the program,” or its “declarative semantics.” Ideally, queries directed to the program would be answered in accordance with this model. We introduce unfounded sets and well-founded partial models, and define the well-founded semantics of a program to be its well-founded partial model. If the well-founded partial model is in fact a model, we call it the well-founded model, and say the program is “well-behaved”. We show that the class of well-behaved programs properly includes previously studied classes of “stratified” and “locally stratified” programs Gelfand and Lifschits have proposed a definition of “unique stable model” for general logic programs. We show that a program has a unique stable model if it has a well-founded model, in which case they are the same. We discuss why the converse is not true.