Inductive situation calculus

Temporal reasoning has always been a major test case for knowledge representation formalisms. In this paper, we develop an inductive variant of the situation calculus in ID-logic, classical logic extended with inductive definitions. This logic has been proposed recently and is an extension of classi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Artificial intelligence Jg. 171; H. 5; S. 332 - 360
Hauptverfasser:	Denecker, Marc, Ternovska, Eugenia
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.04.2007 Elsevier
Schlagworte:	Applied sciences Artificial intelligence Computer science; control theory; systems Exact sciences and technology Inductive definitions Knowledge representation Situation calculus Inductive definitions Situation calculus Knowledge representation Induction Partial ordering Case based reasoning Predicate calculus Inductive learning Modularity Temporal logic Circumscription Temporal reasoning Discrete time Causality Inductive logic programming Artificial intelligence
ISSN:	0004-3702, 1872-7921
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	Temporal reasoning has always been a major test case for knowledge representation formalisms. In this paper, we develop an inductive variant of the situation calculus in ID-logic, classical logic extended with inductive definitions. This logic has been proposed recently and is an extension of classical logic. It allows for a uniform representation of various forms of definitions, including monotone inductive definitions and non-monotone forms of inductive definitions such as iterated induction and induction over well-founded posets. We show that the role of such complex forms of definitions is not limited to mathematics but extends to commonsense knowledge representation. In the ID-logic axiomatization of the situation calculus, fluents and causality predicates are defined by simultaneous induction on the well-founded poset of situations. The inductive approach allows us to solve the ramification problem for the situation calculus in a uniform and modular way. Our solution is among the most general solutions for the ramification problem in the situation calculus. Using previously developed modularity techniques, we show that the basic variant of the inductive situation calculus without ramification rules is equivalent to Reiter-style situation calculus.
AbstractList	Temporal reasoning has always been a major test case for knowledge representation formalisms. In this paper, we develop an inductive variant of the situation calculus in ID-logic, classical logic extended with inductive definitions. This logic has been proposed recently and is an extension of classical logic. It allows for a uniform representation of various forms of definitions, including monotone inductive definitions and non-monotone forms of inductive definitions such as iterated induction and induction over well-founded posets. We show that the role of such complex forms of definitions is not limited to mathematics but extends to commonsense knowledge representation. In the ID-logic axiomatization of the situation calculus, fluents and causality predicates are defined by simultaneous induction on the well-founded poset of situations. The inductive approach allows us to solve the ramification problem for the situation calculus in a uniform and modular way. Our solution is among the most general solutions for the ramification problem in the situation calculus. Using previously developed modularity techniques, we show that the basic variant of the inductive situation calculus without ramification rules is equivalent to Reiter-style situation calculus.
Author	Ternovska, Eugenia Denecker, Marc
Author_xml	– sequence: 1 givenname: Marc surname: Denecker fullname: Denecker, Marc email: Marc.Denecker@cs.kuleuven.be organization: Department of Computer Science, KU Leuven, Belgium – sequence: 2 givenname: Eugenia surname: Ternovska fullname: Ternovska, Eugenia organization: School of Computing Science, Simon Fraser University, Canada
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18702689$$DView record in Pascal Francis
BookMark	eNp9kD9rwzAQxUVJoUnab5AhS0e7J8m2rA6FEvonEOjSzkKWT6Dg2kGSA_32VerSoUOm44733t39FmTWDz0SsqKQU6DV3T7XPro-5gxA5MByAHZB5rQWLBOS0RmZA0CRcQHsiixC2KeWS0nnZLXt29FEd8R1cHHU0Q392ujOjN0Yrsml1V3Am9-6JB_PT--b12z39rLdPO4yw6siZlg2rGpM3TJdWGHKgmstuGl5A7WWWAKrhaASeVsXwhYSmiqNEKVBDbaxfElup9yDDmm39bo3LqiDd5_af6n0B7Cqlkl3P-mMH0LwaJVx8efk6LXrFAV14qH2auKhTjwUMJV4JHPxz_yXf972MNkwATg69CoYh73B1nk0UbWDOx_wDXoYfeU
CODEN	AINTBB
CitedBy_id	crossref_primary_10_1002_int_20408 crossref_primary_10_1145_1342991_1342998 crossref_primary_10_1098_rsos_230785 crossref_primary_10_1016_j_eswa_2009_06_110 crossref_primary_10_1007_s10844_010_0143_2 crossref_primary_10_1017_S1471068424000115 crossref_primary_10_1007_s10489_011_0293_0 crossref_primary_10_1016_j_jal_2013_05_003 crossref_primary_10_1145_2499937_2499938
Cites_doi	10.1007/BF03037169 10.1007/11562931_18 10.1007/978-3-540-24609-1_7 10.1145/383779.383789 10.1145/316542.316545 10.1016/S0304-3975(00)00330-3 10.1016/0004-3702(80)90014-4 10.1016/0168-0072(86)90055-2 10.1016/0004-3702(80)90011-9 10.1145/1342991.1342998 10.1016/S0004-3702(99)00087-9 10.1023/A:1018930122475 10.1016/j.artint.2002.12.001 10.1145/1166109.1166115 10.1145/116825.116838 10.1016/0022-0000(93)90024-Q 10.1016/0004-3702(87)90043-9 10.1016/S0004-3702(96)00033-1
ContentType	Journal Article
Copyright	2007 Elsevier B.V. 2007 INIST-CNRS
Copyright_xml	– notice: 2007 Elsevier B.V. – notice: 2007 INIST-CNRS
DBID	6I. AAFTH AAYXX CITATION IQODW
DOI	10.1016/j.artint.2007.02.002
DatabaseName	ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1872-7921
EndPage	360
ExternalDocumentID	18702689 10_1016_j_artint_2007_02_002 S0004370207000409
GroupedDBID	--K --M --Z -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 4.4 457 4G. 5GY 5VS 6I. 6J9 6TJ 7-5 71M 77K 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AAKPC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACWUS ACZNC ADBBV ADEZE ADMUD AEBSH AECPX AEFWE AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 E3Z EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE IXB J1W JJJVA KOM KQ8 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 TR2 TWZ UPT UQL VQA WH7 WUQ XFK XJE XJT XPP XSW ZMT ~02 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH
ID	FETCH-LOGICAL-c364t-e5b26bc8d2a4f7c543aa73cd3b08a9e50287719e3d847f490b6028ee9cea0fbf3
ISICitedReferencesCount	21
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000246430300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0004-3702
IngestDate	Mon Jul 21 09:11:42 EDT 2025 Sat Nov 29 06:08:04 EST 2025 Tue Nov 18 22:14:30 EST 2025 Fri Feb 23 02:31:59 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	5
Keywords	Inductive definitions Situation calculus Knowledge representation Induction Partial ordering Case based reasoning Predicate calculus Inductive learning Modularity Temporal logic Circumscription Temporal reasoning Discrete time Causality Inductive logic programming Artificial intelligence
Language	English
License	http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c364t-e5b26bc8d2a4f7c543aa73cd3b08a9e50287719e3d847f490b6028ee9cea0fbf3
OpenAccessLink	https://dx.doi.org/10.1016/j.artint.2007.02.002
PageCount	29
ParticipantIDs	pascalfrancis_primary_18702689 crossref_citationtrail_10_1016_j_artint_2007_02_002 crossref_primary_10_1016_j_artint_2007_02_002 elsevier_sciencedirect_doi_10_1016_j_artint_2007_02_002
PublicationCentury	2000
PublicationDate	2007-04-01
PublicationDateYYYYMMDD	2007-04-01
PublicationDate_xml	– month: 04 year: 2007 text: 2007-04-01 day: 01
PublicationDecade	2000
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Artificial intelligence
PublicationYear	2007
Publisher	Elsevier B.V Elsevier
Publisher_xml	– name: Elsevier B.V – name: Elsevier
References	Gelfond, Lifschitz (bib014) 1992 Moschovakis (bib028) 1974 Denecker, Bruynooghe, Marek (bib006) 2001; 2 E. Ternovskaia, Causality via inductive definitions, in: Working Notes of “Prospects for a Commonsense Theory of Causation”, AAAI Spring Symposium Series, March 23–28, 1998 Marek, Truszczyński (bib020) 1999 Gurevich, Shelah (bib016) 1986; 32 Ternovskaia (bib037) 1998; vol. 1472 J. McCarthy, Elaboration tolerance, in: COMMON SENSE 98, Symposium on Logical Formalizations of Commonsense Reasoning, January 1998 Reiter (bib032) 1980; 13 Aczel (bib001) 1977 Denecker (bib004) 1998; vol. 1489 Thielscher (bib039) 1998; 3–4 Niemelä (bib029) 1999; 25 Gelfond, Lifschitz (bib013) 1991; 9 N. McCain, H. Turner, Causal theories of action and change, in: Proc. of AAAI 97, 2007, pp. 460–465 Fages (bib011) 1994; 1 Thielscher (bib038) 1997; 89 D. Mitchell, E. Ternovska, A framework for representing and solving NP search problems, in: Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), 2005, pp. 430–435 Fitting (bib012) 2002; 278 Mariën, Mitra, Denecker, Bruynooghe (bib021) 2005; vol. 3835 Reiter (bib033) 1991 Denecker (bib005) 2000; vol. 1861 Hanks, McDermott (bib017) 1987; 33 Van Gelder, Ross, Schlipf (bib041) 1991; 38 (bib002) 2002 J. Vennekens, D. Gilis, M. Denecker, Splitting an operator: Algebraic modularity results for logics with fixpoint semantics, ACM Transactions on Computational Logic (TOCL) 2006, submitted for publication M. Denecker, E. Ternovska, A logic of non-monotone inductive definitions, ACM Transactions on Computational Logic (TOCL), 2007 Pirri, Reiter (bib031) 1999; 46 Levesque, Pirri, Reiter (bib018) 1998; 2 McCarthy, Hayes (bib025) 1969 McIlraith (bib026) 2000; 116 Shanahan (bib035) 1997 Clark (bib003) 1978 McCarthy (bib023) 1980; 13 F. Lin, Embracing causality in specifying the indirect effects of actions, in: Proc. of IJCAI 95, 1995, pp. 1985–1991 M. Denecker, E. Ternovska, A logic of non-monotone inductive definitions and its modularity properties, in: V. Lifschitz, I. Niemelä (Eds.), 7th International Conference on Logic Programming and Nonmonotonic Reasoning, 2004 Denecker, Theseider Duprè, Van Belleghem (bib009) 1998; 3 Denecker, Ternovska (bib007) 2004 Giunchiglia, Lee, Lifschitz, McCain, Turner (bib015) 2004; 153 N. Pelov, E. Ternovska, Reducing ID-logic to propositional satisfiability, in: Proceedings of the Twenty First International Conference on Logic Programming (ICLP 2005), 2005 Reiter (bib034) 2001 Van Gelder (bib040) 1993; 47 Reiter (10.1016/j.artint.2007.02.002_bib032) 1980; 13 Ternovskaia (10.1016/j.artint.2007.02.002_bib037) 1998; vol. 1472 Gurevich (10.1016/j.artint.2007.02.002_bib016) 1986; 32 McCarthy (10.1016/j.artint.2007.02.002_bib025) 1969 Hanks (10.1016/j.artint.2007.02.002_bib017) 1987; 33 Marek (10.1016/j.artint.2007.02.002_bib020) 1999 Van Gelder (10.1016/j.artint.2007.02.002_bib040) 1993; 47 Thielscher (10.1016/j.artint.2007.02.002_bib038) 1997; 89 Denecker (10.1016/j.artint.2007.02.002_bib009) 1998; 3 10.1016/j.artint.2007.02.002_bib024 Denecker (10.1016/j.artint.2007.02.002_bib005) 2000; vol. 1861 Moschovakis (10.1016/j.artint.2007.02.002_bib028) 1974 Gelfond (10.1016/j.artint.2007.02.002_bib013) 1991; 9 Aczel (10.1016/j.artint.2007.02.002_bib001) 1977 10.1016/j.artint.2007.02.002_bib027 10.1016/j.artint.2007.02.002_bib008 Thielscher (10.1016/j.artint.2007.02.002_bib039) 1998; 3–4 Gelfond (10.1016/j.artint.2007.02.002_bib014) 1992 Fages (10.1016/j.artint.2007.02.002_bib011) 1994; 1 10.1016/j.artint.2007.02.002_bib042 Reiter (10.1016/j.artint.2007.02.002_bib034) 2001 Denecker (10.1016/j.artint.2007.02.002_bib004) 1998; vol. 1489 10.1016/j.artint.2007.02.002_bib022 Levesque (10.1016/j.artint.2007.02.002_bib018) 1998; 2 Clark (10.1016/j.artint.2007.02.002_bib003) 1978 (10.1016/j.artint.2007.02.002_bib002) 2002 Van Gelder (10.1016/j.artint.2007.02.002_bib041) 1991; 38 Pirri (10.1016/j.artint.2007.02.002_bib031) 1999; 46 Giunchiglia (10.1016/j.artint.2007.02.002_bib015) 2004; 153 Niemelä (10.1016/j.artint.2007.02.002_bib029) 1999; 25 Mariën (10.1016/j.artint.2007.02.002_bib021) 2005; vol. 3835 McCarthy (10.1016/j.artint.2007.02.002_bib023) 1980; 13 Fitting (10.1016/j.artint.2007.02.002_bib012) 2002; 278 10.1016/j.artint.2007.02.002_bib036 Denecker (10.1016/j.artint.2007.02.002_bib007) 2004 10.1016/j.artint.2007.02.002_bib019 Denecker (10.1016/j.artint.2007.02.002_bib006) 2001; 2 McIlraith (10.1016/j.artint.2007.02.002_bib026) 2000; 116 Shanahan (10.1016/j.artint.2007.02.002_bib035) 1997 Reiter (10.1016/j.artint.2007.02.002_bib033) 1991 10.1016/j.artint.2007.02.002_bib030 10.1016/j.artint.2007.02.002_bib010
References_xml	– volume: 116 start-page: 87 year: 2000 end-page: 121 ident: bib026 article-title: An axiomatic solution to the ramification problem (sometimes) publication-title: Artificial Intelligence – reference: J. Vennekens, D. Gilis, M. Denecker, Splitting an operator: Algebraic modularity results for logics with fixpoint semantics, ACM Transactions on Computational Logic (TOCL) 2006, submitted for publication – start-page: 463 year: 1969 end-page: 502 ident: bib025 article-title: Some philosophical problems from the standpoint of artificial intelligence publication-title: Machine Intelligence 4 – volume: vol. 1489 start-page: 1 year: 1998 end-page: 16 ident: bib004 article-title: The well-founded semantics is the principle of inductive definition publication-title: Logics in Artificial Intelligence – volume: 1 start-page: 51 year: 1994 end-page: 60 ident: bib011 article-title: Consistency of Clark completion and existence of stable models publication-title: Journal of Methods of Logic in Computer Science – reference: M. Denecker, E. Ternovska, A logic of non-monotone inductive definitions and its modularity properties, in: V. Lifschitz, I. Niemelä (Eds.), 7th International Conference on Logic Programming and Nonmonotonic Reasoning, 2004 – year: 2002 ident: bib002 publication-title: The Description Logic Handbook. Theory, Implementation and Applications – reference: D. Mitchell, E. Ternovska, A framework for representing and solving NP search problems, in: Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), 2005, pp. 430–435 – year: 1992 ident: bib014 article-title: Describing action and change by logic programs publication-title: Ninth Joint International Conference and Symposium on Logic Programming JICSLP'92 – start-page: 375 year: 1999 end-page: 398 ident: bib020 article-title: Stable models and an alternative logic programming paradigm publication-title: The Logic Programming Paradigm: A 25 Years Perspective – volume: 13 start-page: 27 year: 1980 end-page: 39 ident: bib023 article-title: Circumscription—a form of nonmonotonic reasoning publication-title: Artificial Intelligence – reference: M. Denecker, E. Ternovska, A logic of non-monotone inductive definitions, ACM Transactions on Computational Logic (TOCL), 2007 – volume: 278 start-page: 25 year: 2002 end-page: 51 ident: bib012 article-title: Fixpoint semantics for logic programming a survey publication-title: Theoretical Computer Science – volume: 33 start-page: 379 year: 1987 end-page: 412 ident: bib017 article-title: Nonmonotonic logic and temporal projection publication-title: Artificial Intelligence – year: 1974 ident: bib028 article-title: Elementary Induction on Abstract Structures – volume: 2 start-page: 623 year: 2001 end-page: 654 ident: bib006 article-title: Logic programming revisited: logic programs as inductive definitions publication-title: ACM Transactions on Computational Logic – reference: J. McCarthy, Elaboration tolerance, in: COMMON SENSE 98, Symposium on Logical Formalizations of Commonsense Reasoning, January 1998 – year: 1997 ident: bib035 article-title: Solving the Frame Problem – reference: E. Ternovskaia, Causality via inductive definitions, in: Working Notes of “Prospects for a Commonsense Theory of Causation”, AAAI Spring Symposium Series, March 23–28, 1998 – reference: F. Lin, Embracing causality in specifying the indirect effects of actions, in: Proc. of IJCAI 95, 1995, pp. 1985–1991 – volume: 38 start-page: 620 year: 1991 end-page: 650 ident: bib041 article-title: The well-founded semantics for general logic programs publication-title: Journal of the ACM – volume: 13 start-page: 81 year: 1980 end-page: 132 ident: bib032 article-title: A logic for default reasoning publication-title: Artificial Intelligence – start-page: 359 year: 1991 end-page: 380 ident: bib033 article-title: The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression publication-title: Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy – volume: vol. 3835 start-page: 565 year: 2005 end-page: 579 ident: bib021 article-title: Satisfiability checking for PC(ID) publication-title: Proc. LPAR'05 – reference: N. McCain, H. Turner, Causal theories of action and change, in: Proc. of AAAI 97, 2007, pp. 460–465 – volume: 47 start-page: 185 year: 1993 end-page: 221 ident: bib040 article-title: An alternating fixpoint of logic programs with negation publication-title: Journal of Computer and System Sciences – volume: 46 start-page: 325 year: 1999 end-page: 361 ident: bib031 article-title: Some contributions to the metatheory of the situation calculus publication-title: ACM – volume: vol. 1861 start-page: 703 year: 2000 end-page: 717 ident: bib005 article-title: Extending classical logic with inductive definitions publication-title: First International Conference on Computational Logic (CL2000) – volume: 9 start-page: 365 year: 1991 end-page: 385 ident: bib013 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Generation Computing – volume: 3–4 start-page: 179 year: 1998 end-page: 192 ident: bib039 article-title: Introduction to the fluent calculus publication-title: Electronic Transactions on Artificial Intelligence – volume: 3 start-page: 1 year: 1998 end-page: 43 ident: bib009 article-title: An inductive definition approach to ramifications publication-title: Linköping Electronic Articles in Computer and Information Science – reference: N. Pelov, E. Ternovska, Reducing ID-logic to propositional satisfiability, in: Proceedings of the Twenty First International Conference on Logic Programming (ICLP 2005), 2005 – volume: 89 start-page: 317 year: 1997 end-page: 364 ident: bib038 article-title: Ramification and causality publication-title: Journal of Artificial Intelligence – start-page: 545 year: 2004 end-page: 553 ident: bib007 article-title: Inductive situation calculus publication-title: Proceedings of Ninth International Conference on Principles of Knowledge Representation and Reasoning – start-page: 739 year: 1977 end-page: 782 ident: bib001 article-title: An introduction to inductive definitions publication-title: Handbook of Mathematical Logic – volume: 32 start-page: 265 year: 1986 end-page: 280 ident: bib016 article-title: Fixed-point extensions of first-order logic publication-title: Annals of Pure and Applied Logic – start-page: 293 year: 1978 end-page: 322 ident: bib003 article-title: Negation as failure publication-title: Logic and Databases – volume: 25 start-page: 241 year: 1999 end-page: 273 ident: bib029 article-title: Logic programs with stable model semantics as a constraint programming paradigm publication-title: Annals of Mathematics and Artificial Intelligence – year: 2001 ident: bib034 article-title: Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems – volume: vol. 1472 year: 1998 ident: bib037 article-title: Inductive definability and the situation calculus publication-title: Transaction and Change in Logic Databases – volume: 153 start-page: 49 year: 2004 end-page: 104 ident: bib015 article-title: Nonmonotonic causal theories publication-title: Artificial Intelligence (AIJ) – volume: 2 start-page: 159 year: 1998 end-page: 178 ident: bib018 article-title: Foundations for the situation calculus publication-title: Electronic Transactions on Artificial Intelligence – volume: vol. 1861 start-page: 703 year: 2000 ident: 10.1016/j.artint.2007.02.002_bib005 article-title: Extending classical logic with inductive definitions – volume: 3 start-page: 1 issue: 7 year: 1998 ident: 10.1016/j.artint.2007.02.002_bib009 article-title: An inductive definition approach to ramifications publication-title: Linköping Electronic Articles in Computer and Information Science – volume: 9 start-page: 365 year: 1991 ident: 10.1016/j.artint.2007.02.002_bib013 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Generation Computing doi: 10.1007/BF03037169 – start-page: 375 year: 1999 ident: 10.1016/j.artint.2007.02.002_bib020 article-title: Stable models and an alternative logic programming paradigm – ident: 10.1016/j.artint.2007.02.002_bib030 doi: 10.1007/11562931_18 – year: 1997 ident: 10.1016/j.artint.2007.02.002_bib035 – volume: vol. 1472 year: 1998 ident: 10.1016/j.artint.2007.02.002_bib037 article-title: Inductive definability and the situation calculus – ident: 10.1016/j.artint.2007.02.002_bib024 – ident: 10.1016/j.artint.2007.02.002_bib022 – start-page: 293 year: 1978 ident: 10.1016/j.artint.2007.02.002_bib003 article-title: Negation as failure – ident: 10.1016/j.artint.2007.02.002_bib008 doi: 10.1007/978-3-540-24609-1_7 – volume: 2 start-page: 623 issue: 4 year: 2001 ident: 10.1016/j.artint.2007.02.002_bib006 article-title: Logic programming revisited: logic programs as inductive definitions publication-title: ACM Transactions on Computational Logic doi: 10.1145/383779.383789 – volume: 46 start-page: 325 issue: 3 year: 1999 ident: 10.1016/j.artint.2007.02.002_bib031 article-title: Some contributions to the metatheory of the situation calculus publication-title: ACM doi: 10.1145/316542.316545 – volume: 278 start-page: 25 issue: 1–2 year: 2002 ident: 10.1016/j.artint.2007.02.002_bib012 article-title: Fixpoint semantics for logic programming a survey publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(00)00330-3 – start-page: 359 year: 1991 ident: 10.1016/j.artint.2007.02.002_bib033 article-title: The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression – volume: 13 start-page: 81 year: 1980 ident: 10.1016/j.artint.2007.02.002_bib032 article-title: A logic for default reasoning publication-title: Artificial Intelligence doi: 10.1016/0004-3702(80)90014-4 – ident: 10.1016/j.artint.2007.02.002_bib036 – volume: 32 start-page: 265 year: 1986 ident: 10.1016/j.artint.2007.02.002_bib016 article-title: Fixed-point extensions of first-order logic publication-title: Annals of Pure and Applied Logic doi: 10.1016/0168-0072(86)90055-2 – start-page: 463 year: 1969 ident: 10.1016/j.artint.2007.02.002_bib025 article-title: Some philosophical problems from the standpoint of artificial intelligence – ident: 10.1016/j.artint.2007.02.002_bib019 – start-page: 739 year: 1977 ident: 10.1016/j.artint.2007.02.002_bib001 article-title: An introduction to inductive definitions – year: 1992 ident: 10.1016/j.artint.2007.02.002_bib014 article-title: Describing action and change by logic programs – volume: 2 start-page: 159 year: 1998 ident: 10.1016/j.artint.2007.02.002_bib018 article-title: Foundations for the situation calculus publication-title: Electronic Transactions on Artificial Intelligence – volume: 13 start-page: 27 year: 1980 ident: 10.1016/j.artint.2007.02.002_bib023 article-title: Circumscription—a form of nonmonotonic reasoning publication-title: Artificial Intelligence doi: 10.1016/0004-3702(80)90011-9 – ident: 10.1016/j.artint.2007.02.002_bib010 doi: 10.1145/1342991.1342998 – year: 2001 ident: 10.1016/j.artint.2007.02.002_bib034 – volume: 116 start-page: 87 issue: 1–2 year: 2000 ident: 10.1016/j.artint.2007.02.002_bib026 article-title: An axiomatic solution to the ramification problem (sometimes) publication-title: Artificial Intelligence doi: 10.1016/S0004-3702(99)00087-9 – volume: vol. 1489 start-page: 1 year: 1998 ident: 10.1016/j.artint.2007.02.002_bib004 article-title: The well-founded semantics is the principle of inductive definition – start-page: 545 year: 2004 ident: 10.1016/j.artint.2007.02.002_bib007 article-title: Inductive situation calculus – ident: 10.1016/j.artint.2007.02.002_bib027 – year: 2002 ident: 10.1016/j.artint.2007.02.002_bib002 – volume: 25 start-page: 241 issue: 3,4 year: 1999 ident: 10.1016/j.artint.2007.02.002_bib029 article-title: Logic programs with stable model semantics as a constraint programming paradigm publication-title: Annals of Mathematics and Artificial Intelligence doi: 10.1023/A:1018930122475 – volume: 153 start-page: 49 year: 2004 ident: 10.1016/j.artint.2007.02.002_bib015 article-title: Nonmonotonic causal theories publication-title: Artificial Intelligence (AIJ) doi: 10.1016/j.artint.2002.12.001 – ident: 10.1016/j.artint.2007.02.002_bib042 doi: 10.1145/1166109.1166115 – volume: 1 start-page: 51 year: 1994 ident: 10.1016/j.artint.2007.02.002_bib011 article-title: Consistency of Clark completion and existence of stable models publication-title: Journal of Methods of Logic in Computer Science – year: 1974 ident: 10.1016/j.artint.2007.02.002_bib028 – volume: 3–4 start-page: 179 year: 1998 ident: 10.1016/j.artint.2007.02.002_bib039 article-title: Introduction to the fluent calculus publication-title: Electronic Transactions on Artificial Intelligence – volume: 38 start-page: 620 issue: 3 year: 1991 ident: 10.1016/j.artint.2007.02.002_bib041 article-title: The well-founded semantics for general logic programs publication-title: Journal of the ACM doi: 10.1145/116825.116838 – volume: 47 start-page: 185 year: 1993 ident: 10.1016/j.artint.2007.02.002_bib040 article-title: An alternating fixpoint of logic programs with negation publication-title: Journal of Computer and System Sciences doi: 10.1016/0022-0000(93)90024-Q – volume: 33 start-page: 379 year: 1987 ident: 10.1016/j.artint.2007.02.002_bib017 article-title: Nonmonotonic logic and temporal projection publication-title: Artificial Intelligence doi: 10.1016/0004-3702(87)90043-9 – volume: 89 start-page: 317 year: 1997 ident: 10.1016/j.artint.2007.02.002_bib038 article-title: Ramification and causality publication-title: Journal of Artificial Intelligence doi: 10.1016/S0004-3702(96)00033-1 – volume: vol. 3835 start-page: 565 year: 2005 ident: 10.1016/j.artint.2007.02.002_bib021 article-title: Satisfiability checking for PC(ID)
SSID	ssj0003991
Score	2.0197852
Snippet	Temporal reasoning has always been a major test case for knowledge representation formalisms. In this paper, we develop an inductive variant of the situation...
SourceID	pascalfrancis crossref elsevier
SourceType	Index Database Enrichment Source Publisher
StartPage	332
SubjectTerms	Applied sciences Artificial intelligence Computer science; control theory; systems Exact sciences and technology Inductive definitions Knowledge representation Situation calculus
Title	Inductive situation calculus
URI	https://dx.doi.org/10.1016/j.artint.2007.02.002
Volume	171
WOSCitedRecordID	wos000246430300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7921 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Na9swFBddssOg7LOj6bLiw27FQ7Fkyzqa4LG2JC20G7kZWZFKQvFC7Jb8-X2yZMdZGdkOu5jwsGLyfsr78tP7IfSFRVxxgnMfRwL7lArpx0RD1hqa17wSU610TTbBptN4NuPXjt69rOkEWFHEmw1f_VeoQQZgm6Oz_wB3-6UggM8AOlwBdrj-FfCGjKM2YmflorKDvM8ACFPmK7uhaLKu24Rq0o7OXM42sk2n6fjS9klMQEVtip9Orn7eXCb2lMyd6dXbqRywTsNJXc5yvnfHPFKwOHjXPFqKFLcPQr9r7oirTVrPSSwzwDOjbOsDy6_1XITKjY00c1KDrRNqXrz_5pvajsER2JUgivkL1A9YyOMe6ifn6eyi9boQaDl2RPsTmmOSdS_f8yf_KQw5XIkSMNGW1aQTaty-Ra9djuAlFtt36EAV79Ebly94zhqXIGooORrZBzRs0fda9L0G_SP041t6O_7uOwIMX5KIVr4K8yDKZTwPBNVMhpQIwYickxzHgqsQYkPGRlyROcQYmnKcRyBSikslsM41-Yh6xa9CHSMvCvWIay0ohLsmyc3nAayXmgoWmRF6A0QafWTSTYc3JCX3WdMGuMysFg1xKctwkIEWB8hvV63sdJQ997NG1ZmL8GzklsFe2bPydAeZ7ePcxjjZd8Mn9Gr7JxiiXrV-UJ_RS_lYLcr1qdtOT_Aed5k
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Inductive+situation+calculus&rft.jtitle=Artificial+intelligence&rft.au=DENECKER%2C+Marc&rft.au=TEMOVSKA%2C+Eugenia&rft.date=2007-04-01&rft.pub=Elsevier&rft.issn=0004-3702&rft.volume=171&rft.issue=5-6&rft.spage=332&rft.epage=360&rft_id=info:doi/10.1016%2Fj.artint.2007.02.002&rft.externalDBID=n%2Fa&rft.externalDocID=18702689
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon