Journal of Logic Programming
Relational queries computable in polynomial time
Information and Control
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Foundations of deductive databases and logic programming
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs
Foundations of deductive databases and logic programming
On the declarative semantics of logic programs with negation
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
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
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Procedural and declarative database update languages
Proceedings of the seventh 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
Minimum and maximum predicates in logic programming
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
Queries are easier than you thought (probably)
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The valid model semantics for logic programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Monotonic aggregation in deductive databases
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Implementing deductive databases by linear programming
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Some recent developments in deductive databases
ACM SIGMOD Record
An alternating fixpoint tailored to magic programs
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Design and implementation of the glue-nail database system
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
A three-valued semantics for deductive databases and logic programs
Journal of Computer and System Sciences
Mixed integer programming methods for computing nonmonotonic deductive databases
Journal of the ACM (JACM)
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
Implementing deductive databases by mixed integer programming
ACM Transactions on Database Systems (TODS)
A unified framework for enforcing multiple access control policies
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
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
Flexible support for multiple access control policies
ACM Transactions on Database Systems (TODS)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
On the partial semantics for disjunctive deductive databases
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
The glue-nail deductive database system: design, implementation, and evaluation
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
An Extended Petri Net Model for Normal Logic Programs
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
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
Nonmonotonic Logic Programming
IEEE Transactions on Knowledge and Data Engineering
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
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
The Well-Founded Semantics in Normal Logic Programs with Uncertainty
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Capturing Stationary and Regular Extensions with Reiter's Extensions
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
An Infinite-Valued Semantics for Logic Programs with Negation
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Uncertainty and Partial Non-uniform Assumptions in Parametric Deductive Databases
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Well-Founded Optimism: Inheritance in Frame-Based Knowledge Bases
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
On the Problem of Computing the Well-Founded Semantics
CL '00 Proceedings of the First International Conference on Computational Logic
Soft stratification for magic set based query evaluation in deductive databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data and knowledge in database systems: deductive databases
Handbook of data mining and knowledge discovery
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Removing permissions in the flexible authorization framework
ACM Transactions on Database Systems (TODS)
Parametrized semantics of logic programs: a unifying framework
Theoretical Computer Science
Transformation-based bottom-up computation of the well-founded model
Theory and Practice of Logic Programming
On the problem of computing the well-founded semantics
Theory and Practice of Logic Programming
A uniform approach to logic programming semantics
Theory and Practice of Logic Programming
Minimum model semantics for logic programs with negation-as-failure
ACM Transactions on Computational Logic (TOCL)
Epistemic foundation of stable model semantics
Theory and Practice of Logic Programming
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
Computer-aided Support for Secure Tropos
Automated Software Engineering
A paraconsistent logic programming approach for querying inconsistent databases
International Journal of Approximate Reasoning
Towards a general web rule language
International Journal of Web Engineering and Technology
Proceedings of the 17th international conference on World Wide Web
Consistent Data Integration in P2P Deductive Databases
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
Answer Set Programming for Single-Player Games in General Game Playing
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A Default Approach to Semantics of Logic Programs with Constraint Atoms
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Queries to Hybrid MKNF Knowledge Bases through Oracular Tabling
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Towards tractable local closed world reasoning for the semantic web
EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
Well-founded semantics for description logic programs in the semantic web
ACM Transactions on Computational Logic (TOCL)
Database theory: query languages
Algorithms and theory of computation handbook
Local closed world reasoning with description logics under the well-founded semantics
Artificial Intelligence
Rules and logic programming for the web
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Creating objects in the flexible authorization framework
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Implementing query answering for hybrid MKNF knowledge bases
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Security and trust requirements engineering
Foundations of Security Analysis and Design III
Automated verification of state sequence invariants in general game playing
Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
The good, the bad, and the odd: cycles in answer-set programs
ESSLLI'10 Proceedings of the 2010 international conference on New Directions in Logic, Language and Computation
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
Complexity of Recursive Normal Default Logic
Fundamenta Informaticae
Fundamenta Informaticae
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Query-Driven Procedures for Hybrid MKNF Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
We introduce and describe the alternating fixpoint of a logic program with negation. The underlying idea is to monotonically build up a set of negative conclusions until the least fixpoint is reached, using a transformation related to the one that defines stable models, developed by Gelfand and Lifschitz. From a fixed set of negative conclusions, we can derive the positive conclusions that follow (without deriving any further negative ones), by traditional Horn clause semantics. The union of positive and negative conclusions is called the alternating fixpoint partial model. The name “alternating” was chosen because the transformation runs in two passes; the first pass transforms an underestimate of the set of negative conclusions into an (intermediate) overestimate; the second pass transforms the overestimates into a new underestimate; the composition of the two passes is monotonic.Our main theorem is that the alternating fixpoint partial model is exactly the well-founded partial model.We also show that a system is fixpoint logic, which permits rule bodies to be first order formulas but requires inductive relations to be positive within them, can be transformed straightforwardly into a normal logic program whose alternating fixpoint partial model corresponds to the least fixpoint of the fixpoint logic system. Thus alternating fixpoint logic is at least as expressive as fixpoint logic. The converse is shown to hold for finite structures.